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 vote121 views1 answer
Is there garbage collection in c++
C++
0 vote108 views1 answer
How to get an element in a list c++
C++
0 vote164 views1 answer
For statement in c++
C++
0 vote123 views1 answer
130 divided by -10
C++
11 votes121 views3 answers
C++ map iterator
C++
0 vote129 views1 answer
C++ count vector elements
C++
0 vote122 views1 answer
How-to-read-until-eof-from-cin-in-c++
C++
0 vote126 views1 answer
#defie in c++
C++
0 vote211 views1 answer
Dynamically allocate a string object and save the address in the pointer variable p.
C++
4 votes177 views1 answer
Continue c++
C++