Prime chec kin c

int isPrime(long long number) {

	if (number == 0 || number == 1 || (number % 2 == 0 && number > 2)) {
		return 0;
	}

	else {
		for (long long i=3; i <= (long long)sqrt(number)+1; i++) {
			if (number % i == 0) {
				return 0;
			}
		}
		return 1;
	}
}

Similar codes

0 vote193 views1 answer
What keyword covers unhandled possibilities?
C
0 vote225 views1 answer
Ruby find object in array by attribute
C
0 vote196 views1 answer
BSTNode root
C
2 votes150 views2 answers
Swap variables in c
C
0 vote205 views1 answer
Sue murry
C
0 vote202 views2 answers
How to determine the level of each node in the given tree?
C
2 votes322 views1 answer
“ln: failed to create symbolic link '/etc/alternatives/java': File exists”
C
29 votes263 views1 answer
C challenge
C
0 vote260 views1 answer
National festivals of india in hindi
C
0 vote208 views1 answer
Linux_reboot_magic2
C