/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 vote209 views2 answers
Or in c++
C++
0 vote180 views1 answer
How to add numbers in c++
C++
0 vote179 views1 answer
Input time from console C++
C++
0 vote164 views1 answer
How to pronounce beaucoup
C++
0 vote182 views1 answer
Pca compact trick
C++
0 vote194 views1 answer
Equals operator c++ overlaod
C++
1 vote171 views2 answers
Insert vector to end of vector c++
C++
1 vote393 views1 answer
BAPS
C++
0 vote172 views1 answer
Kadane algo
C++
4 votes162 views2 answers
C++ function as pointer
C++