/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 vote147 views1 answer
How to write a conclusion statement for an informative essay
C++
0 vote214 views1 answer
C++ add to array
C++
1 vote152 views2 answers
C++ code for selection sort
C++
8 votes145 views3 answers
Min in c++
C++
24 votes149 views5 answers
Install heroku
C++
0 vote156 views1 answer
Scan line in c++
C++
10 votes149 views3 answers
Integer to char c++
C++
148 votes306 views10 answers
Grepper
C++
0 vote164 views2 answers
Memory leak in cpp
C++
5 votes179 views3 answers
Fast io c++
C++