/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

4 votes189 views1 answer
Fork was not declared in this scope
C++
0 vote186 views1 answer
Std::ifstream cant read file to large
C++
1 vote179 views10 answers
C++ to python converter online
C++
7 votes125 views1 answer
Remove from the front of a vector
C++
0 vote183 views1 answer
Iteration in c++
C++
0 vote178 views1 answer
Test3
C++
1 vote187 views1 answer
C++ round number up
C++
0 vote172 views1 answer
Unknown amount of threads cpp
C++
3 votes148 views1 answer
Rapidjson parse
C++
0 vote184 views1 answer
C++ rand include
C++