/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 vote143 views1 answer
A[12] = h + A[8]
C++
0 vote149 views1 answer
C++ little endian or big endian
C++
10 votes153 views2 answers
Check if char in string c++
C++
0 vote165 views1 answer
Cpp serial print override always in same place
C++
4 votes163 views3 answers
Pi in c++
C++
0 vote145 views1 answer
Read large files part by part in C++
C++
23 votes177 views6 answers
Team fortress
C++
0 vote164 views1 answer
Assoc-right antlr
C++
5 votes152 views1 answer
What library to mention for swap function in c++
C++
0 vote190 views1 answer
How to traverse through vector pair
C++