/C++/Fast way to check if a number is prime C++

Fast way to check if a number is prime C++

//O(sqrt(n))
bool isPrime(int num){
    if(num <= 1) return false;
    for(int i = 2; i <= sqrt(num); i++){
          if(num % i == 0) return false;
    }
    return true;
}

-1

Source: stackoverflow.com

Similar codes

1 vote215 views3 answers
C++ split string on newline
C++
11 votes255 views5 answers
How to sort array in c++
C++
0 vote246 views1 answer
3 conditions for a while loop c++
C++
1 vote254 views1 answer
Crtdbg c++
C++
0 vote229 views1 answer
Qt make widget ignore mouse events
C++
-1 vote215 views3 answers
Program to check smallest num in three numbers in c++
C++
0 vote254 views1 answer
C++ remove all elements equal to
C++
0 vote246 views1 answer
How to loop through a set of pairs in c++
C++
0 vote211 views1 answer
Two D Arrays
C++
0 vote232 views7 answers
C++ convert to assembly language
C++