/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 vote179 views1 answer
Summary a long walk to water
C++
1 vote247 views1 answer
Convert a hexadecimal number into decimal c++
C++
4 votes216 views1 answer
Deep copy c++
C++
0 vote168 views1 answer
Why the << operator is friend
C++
30 votes219 views10 answers
Google translate
C++
7 votes242 views1 answer
Nearest integer rounding in c++
C++
2 votes185 views1 answer
Replace a char in string c++ at a specific index
C++
99 votes480 views6 answers
How to convert int to string c++
C++
0 vote201 views1 answer
C++ foreach vector
C++
0 vote170 views1 answer
C for loop decrement
C++