fast way to check if a number is prime c 2b 2b

Solutions on MaxInterview for fast way to check if a number is prime c 2b 2b by the best coders in the world

Search
showing results for - "fast way to check if a number is prime c 2b 2b"
Michela
04 Jun 2018
1//O(sqrt(n))
2bool isPrime(int num){
3    if(num <= 1) return false;
4    for(int i = 2; i <= sqrt(num); i++){
5          if(num % i == 0) return false;
6    }
7    return true;
8}
9
source
similar questions
prime number generator c 2b 2bc 2b 2b prime number checkc 2b 2b check primeisprime c 2b 2bcheck prime number c 2b 2bprime numbers less than a given number c 2b 2bfinding the prime numer in c 2b 2bprime number c 2b 2bcheck prime cpp gfgc 2b 2b find prime numbersc 2b 2b prime number programprimes from 1 to n c 2b 2bprime factorisation of a number in c 2b 2bc 2b 2b program to generate prime numberscheck prime in c 2b 2bhow to get the prime number in c 2b 2b where time complexity is 0 28log n 29
queries leading to this page
fastest way to check if a number is prime c 2b 2bcheck prime in cppfast way to check if a number is prime c 2b 2b