/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 vote165 views3 answers
Iff cpp
C++
0 vote161 views1 answer
Square gcode
C++
6 votes188 views9 answers
Preorder to postorder converter online
C++
0 vote180 views1 answer
ImportError: cannot import name 'TFLiteConverter' from 'tensorflow.lite'
C++
0 vote172 views2 answers
Accepting multiple values from a function in cpp
C++
3 votes161 views2 answers
C++ round number to whole
C++
0 vote155 views1 answer
How to allocate memory for vector c++
C++
0 vote173 views1 answer
Exit: redefinition; '__declspec(noreturn)' or '[[noreturn]]'
C++
23 votes155 views2 answers
What is c++ function
C++
1 vote164 views1 answer
What is syntex for inheritence in c++
C++