/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 votes283 views1 answer
How to check if c++ compiler is installed windows
C++
6 votes368 views1 answer
Void value not ignored as it ought to be
C++
0 vote344 views1 answer
Hashset in cpp
C++
10 votes569 views6 answers
C to c++ converter online
C++
19 votes314 views1 answer
File objects in c++
C++
0 vote343 views1 answer
Pass map as reference c++
C++
0 vote338 views1 answer
Is power of 2
C++
0 vote360 views2 answers
Default order in set in c++
C++
1 vote397 views1 answer
How to compile opencv c++ in ubuntu
C++
7 votes364 views3 answers
Read string with spaces in c++
C++