/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 vote153 views1 answer
How to run a c++ program in the background
C++
0 vote173 views1 answer
C++ lettura file
C++
0 vote161 views1 answer
C++ write to csv file append
C++
5 votes740 views1 answer
Exit() in c++
C++
30 votes163 views10 answers
Google translate
C++
0 vote158 views2 answers
C++ char it is a number
C++
0 vote172 views1 answer
Print stack without pop c++
C++
0 vote121 views1 answer
Replace a substring with another string in c++
C++
0 vote167 views1 answer
How to print a word in c++
C++
0 vote161 views1 answer
Summation of Natural Number Sequence with c and c++.
C++