Check prime cpp gfg

bool isPrime(int s){
   if(s <= 1) return false;
   if(s == 2) return true;
   for(int i = 2; i * i <= s; i++) {
       if(s % i== 0) return false;
   }
   return true;
}

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 vote135 views1 answer
How to create a c++ templeate
C++
1 vote163 views1 answer
String hex to int c++
C++
0 vote129 views1 answer
How to use getline function inc
C++
0 vote141 views1 answer
Mkdir c++
C++
3 votes145 views2 answers
Find maximum sum in array of contiguous subarrays
C++
12 votes141 views2 answers
Underline in latex
C++
3 votes168 views2 answers
Convert whole string to uppercase c++
C++
4 votes123 views1 answer
C++ natural log
C++
0 vote134 views2 answers
How to compile with libstdc++ fedora
C++
0 vote139 views1 answer
Xor in c++
C++