/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

9 votes121 views5 answers
C++ cin cout
C++
2 votes124 views1 answer
How to hide ui elements unity
C++
12 votes117 views3 answers
C++ vector size
C++
0 vote163 views1 answer
How to cehck if list has element c++
C++
4 votes112 views1 answer
Cpp iterator of element
C++
1 vote127 views1 answer
Chess perft 5
C++
1 vote118 views2 answers
C++ array sort method
C++
0 vote64 views1 answer
Getting int command line arguments c++
C++
0 vote120 views1 answer
Powers of 2 in cpp
C++
2 votes128 views1 answer
Disable a warning in visual c++
C++