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

1 vote165 views1 answer
Naive pattern matching algorithm
C++
0 vote173 views1 answer
Delete heap array c
C++
0 vote165 views1 answer
Store array in vector
C++
1 vote175 views1 answer
Modulo Exponentiaon,Iteratve Modulo Exponentiation
C++
0 vote173 views1 answer
How to add space in c++
C++
2 votes169 views1 answer
How to complie with c++ 17
C++
0 vote162 views1 answer
3 conditions for a while loop c++
C++
0 vote164 views1 answer
Binary search c++
C++
0 vote177 views1 answer
Cplusplus
C++
0 vote183 views1 answer
Bash script add another user
C++