/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 vote275 views1 answer
Is C++ useful in 2021
C++
0 vote303 views1 answer
C++ write number to registry
C++
9 votes323 views2 answers
C++ remove last element from array
C++
0 vote279 views1 answer
What is push() c++
C++
21 votes363 views3 answers
C++ access second last element of vector
C++
0 vote304 views1 answer
C++ singleton prevent copy
C++
0 vote298 views1 answer
First and last digit of a number in c++
C++
4 votes272 views1 answer
Eosio multi index secondary index
C++
101 votes479 views6 answers
How to turn int into string c++
C++
0 vote269 views1 answer
Flowchart to display factors of a number
C++