/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

10 votes230 views3 answers
How to find maximum value in c++
C++
0 vote219 views1 answer
Cudamemcpy
C++
1 vote219 views1 answer
Gmod hitman job code
C++
1 vote287 views1 answer
How to make a parameter optional in c++
C++
1 vote220 views1 answer
What is difffrence between s.length() and s.size()
C++
2 votes193 views1 answer
Qstring mid
C++
1 vote241 views1 answer
Cpp vector structure
C++
0 vote221 views1 answer
How to check size of file in c++
C++
5 votes229 views1 answer
Qt debug
C++
1 vote219 views4 answers
Return function in cpp
C++