/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

3 votes364 views2 answers
Set precision in c++ no decimal places\
C++
1 vote398 views1 answer
Qt remove resize handle
C++
1 vote354 views1 answer
True/false: the ampersand ( &) is used to dereference a pointer variable in c++.
C++
0 vote363 views1 answer
C++ clip values
C++
0 vote332 views1 answer
Crypto npm random bytes
C++
0 vote371 views1 answer
Void does not a name a type in cpp
C++
0 vote381 views1 answer
C++ vector push if not exist
C++
0 vote349 views1 answer
What is the format specifier for dword c++
C++
0 vote349 views1 answer
What is the "-->" operator in C/C++?
C++
1 vote328 views1 answer
Convert a hexadecimal number into decimal c++
C++