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 vote357 views1 answer
Write a C++ program to Computing Mean and Median Using Arrays
C++
29 votes329 views2 answers
C program runner
C++
2 votes358 views5 answers
How to sort a vector
C++
0 vote394 views1 answer
Polycarp found a rectangular table consisting of n rows and m columns. He noticed that each cell of the table has its number, obtained by the following algorithm "by columns": codeforces solution
C++
19 votes344 views1 answer
How to do file handling in c++
C++
0 vote330 views2 answers
Size of unordered_set
C++
2 votes338 views3 answers
Linear search
C++
0 vote428 views1 answer
C++ convert const char* to int
C++
0 vote308 views2 answers
C++ how to read from a file
C++
2 votes306 views1 answer
How to interface c++ in haxe
C++