/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

3 votes264 views6 answers
C++ loop
C++
1 vote270 views4 answers
How to use string in c++
C++
0 vote259 views1 answer
C++ std::find with lambda
C++
-1 vote257 views1 answer
Socket programming in cpp
C++
24 votes295 views5 answers
Size of array
C++
1 vote274 views1 answer
Qstring get if empty
C++
0 vote275 views1 answer
C++ shared pointer operator bool
C++
0 vote271 views1 answer
Entering char in int c++ avoid loop
C++
0 vote248 views1 answer
Move letter position using c++ with input
C++
0 vote324 views1 answer
How to print a text in c++
C++