/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 vote128 views1 answer
Test3
C++
0 vote134 views1 answer
How to remove the % in zsh that show after running c++ file
C++
16 votes133 views1 answer
If vector contains value c++
C++
0 vote127 views1 answer
Gfgdf
C++
38 votes105 views10 answers
Convert whole string to lowercase c++
C++
0 vote149 views1 answer
Import matrix from excel to matlab
C++
4 votes146 views2 answers
Max_element c++
C++
0 vote130 views1 answer
Abstraction in cpp
C++
0 vote142 views1 answer
Has substr c++
C++
2 votes127 views5 answers
C++ loop through array
C++