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

4 votes369 views1 answer
Delete 2d dynamic array c++
C++
1 vote396 views1 answer
Multiply two numbers <=10^18 %m in cpp
C++
31 votes316 views1 answer
When to use struct vs class c++
C++
2 votes391 views1 answer
++x vs x++
C++
0 vote391 views1 answer
Balanced brackets hackerrank solution c++
C++
0 vote346 views1 answer
Changing key bindings in visual code not working
C++
25 votes330 views5 answers
Sort vector in descending order c++
C++
0 vote399 views1 answer
C++ start process and get output
C++
0 vote330 views1 answer
Leetcode fast io c++
C++
1 vote346 views1 answer
C++ string not printing
C++