/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 vote237 views1 answer
How to get a letter from the users string in c++
C++
1 vote259 views1 answer
C++ strings equal
C++
0 vote245 views1 answer
Why exceptions can lead to memory leaks
C++
0 vote227 views1 answer
& in xml
C++
0 vote233 views1 answer
Adddynamic ue4 c++
C++
0 vote209 views1 answer
C++ while loop decrement
C++
0 vote224 views1 answer
Ue4 c++ add tag
C++
0 vote262 views1 answer
Cuda atomic swap
C++
0 vote223 views7 answers
C code to mips assembly converter online
C++
6 votes257 views3 answers
Convert set to vector c++
C++