/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 vote352 views1 answer
Intersection between vector c++
C++
2 votes331 views1 answer
Arduino struct
C++
0 vote326 views1 answer
Error c4001 site:docs.microsoft.com
C++
1 vote370 views2 answers
How to pause a c++ program.
C++
0 vote388 views1 answer
Two dimensional array A[N,M] with the random numbers from 10 to 90.
C++
1 vote351 views1 answer
How to read a line from the console in c++
C++
10 votes283 views2 answers
Why convert char* to string c++
C++
0 vote337 views1 answer
Age in days in c++
C++
0 vote302 views1 answer
Google test assert stdout
C++
3 votes295 views2 answers
Convert long int to binary string c++
C++