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 vote230 views1 answer
The program must enter a natural number n from the console and find the number previous to n that is not divisible by 2 , 3 and 5 .
C++
16 votes237 views6 answers
Sort vector c++
C++
3 votes247 views1 answer
C++ initialize array with all zeros
C++
0 vote230 views1 answer
Surf interpolation matlab
C++
23 votes235 views1 answer
C++ reverse vector
C++
0 vote231 views1 answer
Input time from console C++
C++
1 vote232 views1 answer
Marksheet make in the c++
C++
1 vote258 views1 answer
Ray sphere intersection equation
C++
0 vote247 views1 answer
Nodeafternode
C++
-1 vote220 views1 answer
Longest increasing subsequence nlogn c++
C++