/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

2 votes251 views3 answers
Print space in array cpp
C++
3 votes206 views1 answer
Loop over multidimensional array c++
C++
0 vote244 views1 answer
C++ iterate over vector of pointers
C++
1 vote246 views1 answer
Binary exponentiation
C++
0 vote254 views1 answer
Use of strstr in c++
C++
0 vote250 views1 answer
How to declare an enum variable c++
C++
0 vote246 views2 answers
Round all columns in R dataframe to 3 digits
C++
0 vote261 views1 answer
C++ set element at index
C++
-1 vote251 views1 answer
C++ set console title
C++
1 vote234 views1 answer
Controlling in windows
C++