/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

0 vote201 views1 answer
C++ define array with values
C++
0 vote217 views1 answer
Namespace file linking c++
C++
0 vote200 views1 answer
Move mouse c++
C++
2 votes220 views1 answer
Unity failed to load window layout
C++
0 vote199 views1 answer
Setw in c++
C++
0 vote201 views1 answer
Thread group c++
C++
0 vote208 views1 answer
How to use mersenne_twister_engine in c++ to generate random numbers
C++
0 vote212 views1 answer
C++ capture screen as pixel array
C++
0 vote211 views1 answer
Unpack tuple c++
C++
2 votes201 views2 answers
Anagram
C++