/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 vote210 views1 answer
Regex for phone number c++
C++
0 vote225 views1 answer
271533778232847
C++
1 vote233 views1 answer
Print 5 table in c++
C++
0 vote210 views1 answer
C++ define array with values
C++
0 vote225 views1 answer
Sort using lambda c++
C++
0 vote202 views1 answer
Flowchart to display factors of a number
C++
0 vote224 views1 answer
Convert characters to lowercase c++
C++
0 vote220 views1 answer
Get value of enum cpp
C++
26 votes222 views2 answers
Remove from vector by value c++
C++
2 votes226 views2 answers
Strlen in c++
C++