/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

0 vote271 views1 answer
What is blob in computer vision
C++
0 vote295 views1 answer
How to find total numbe of distinct characters in a string in c
C++
5 votes356 views1 answer
How to sort a string in c++
C++
0 vote305 views1 answer
Initialize 2d array c++ memset
C++
6 votes236 views1 answer
C++ call static method
C++
4 votes280 views2 answers
Vector.find()
C++
0 vote278 views1 answer
C++ vector quick search
C++
1 vote301 views4 answers
C++ pause
C++
0 vote272 views1 answer
C++ thread wait fro 1 sec
C++
0 vote269 views1 answer
A suprise... c++
C++