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 vote141 views1 answer
F && T || !(T) && F
C++
1 vote173 views1 answer
Write a code that adds two number
C++
0 vote142 views2 answers
Default order in set in c++
C++
0 vote137 views2 answers
C ++ splitlines
C++
19 votes191 views4 answers
How to get size of 2d vector in c++
C++
0 vote150 views1 answer
C++ unittest in ros
C++
1 vote153 views1 answer
How to do sets in cpp
C++
0 vote153 views1 answer
Compile c++ program
C++
14 votes152 views6 answers
How to get size of array c++
C++
0 vote162 views1 answer
Split the array there is an array val of n integers . A good subarray is defined as
C++