/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 vote136 views1 answer
Iterate const vector
C++
0 vote131 views4 answers
How to modify 2d array in function c++
C++
1 vote133 views1 answer
How to concatinate two strings in c++
C++
0 vote145 views1 answer
What is the format specifier for dword c++
C++
2 votes142 views1 answer
Recursive binary search
C++
1 vote137 views1 answer
Create n threads cpp
C++
0 vote126 views1 answer
Kadane algorithm with negative numbers included as sum
C++
3 votes128 views2 answers
A+b+c whole square
C++
0 vote137 views1 answer
Inconsequential meaning
C++
0 vote142 views1 answer
Std::set remove item
C++