/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

20 votes107 views4 answers
Cin getline
C++
1 vote97 views1 answer
Perulangan c++
C++
5 votes103 views2 answers
String c++ if letter is lowercase
C++
-2 votes100 views1 answer
Uses of c++
C++
16 votes105 views1 answer
If vector contains value c++
C++
2 votes99 views1 answer
C++ print colorful
C++
0 vote55 views1 answer
Sort deque in c++
C++
0 vote102 views1 answer
Binary algebra cpp
C++
1 vote101 views2 answers
Read comma separated text file in c++
C++
0 vote99 views1 answer
Mid of linked list
C++