/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

5 votes195 views3 answers
Convert vector to set c++
C++
0 vote219 views2 answers
What is ++i and i++
C++
2 votes218 views1 answer
MPI_file_open
C++
1 vote337 views1 answer
C++ vs c#
C++
0 vote194 views1 answer
How to grab numbers from string in cpp
C++
1 vote189 views1 answer
C++ remove n characters from string
C++
0 vote200 views1 answer
Arduino buildin let
C++
0 vote188 views1 answer
Error: ‘memset’ was not declared in this scope in cpp
C++
1 vote180 views1 answer
Sony pictures animation films produced
C++
0 vote195 views1 answer
Libc++abi.dylib: terminating with uncaught exception of type std::invalid_argument: stoi: no conversion
C++