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 vote312 views1 answer
Get an array with c++
C++
1 vote251 views1 answer
How to fill all of the array in c++
C++
0 vote308 views1 answer
Dynamic memory in c++
C++
0 vote286 views1 answer
Display dot product of two Arrays.
C++
0 vote250 views1 answer
Prefix array algorithm in c++
C++
1 vote294 views1 answer
Detect cycle in an undirected graph
C++
2 votes288 views2 answers
Run cmd command c++
C++
1 vote316 views1 answer
C++ 20 struct initialization
C++
2 votes307 views2 answers
C++ starter
C++
0 vote312 views1 answer
Sfml get position
C++