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 vote107 views1 answer
C++ unittest in ros
C++
0 vote107 views1 answer
Windows servis from console app
C++
0 vote103 views1 answer
Size of set c++
C++
0 vote129 views1 answer
Lexene token pairs of java codes
C++
0 vote68 views1 answer
C++ starting syntaz
C++
0 vote103 views1 answer
Cout wchar_t
C++
4 votes94 views1 answer
C++ natural log
C++
6 votes109 views6 answers
C++ sort vector
C++
1 vote102 views1 answer
What does the modularity mean in c++
C++
0 vote106 views1 answer
Qt how to make a file browser
C++