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

2 votes182 views2 answers
Nginx reverse proxy nextcloud
C
0 vote190 views1 answer
Sue murry
C
0 vote180 views1 answer
11*179*.9*1.35
C
0 vote195 views5 answers
[email protected]
C
1 vote169 views1 answer
Accessing elements of 1d array using pointers
C
0 vote231 views1 answer
Mosquitto MQTT client arguments
C
0 vote198 views1 answer
D3 box shadow
C
8 votes202 views3 answers
Casting in c
C
1 vote176 views1 answer
Linux play youtube audio only
C
0 vote169 views2 answers
Deepak
C