/C++/Fast way to check if a number is prime C++

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 vote377 views1 answer
How to print a text in c++
C++
0 vote358 views1 answer
C++ start process and get output
C++
1 vote316 views2 answers
C++ display numbers as binary
C++
0 vote333 views1 answer
Write a C++ program to Computing Mean and Median Using Arrays
C++
1 vote291 views1 answer
Traverse through a string cpp
C++
0 vote317 views1 answer
Partition in STL using vector
C++
20 votes295 views2 answers
Find height of a tree
C++
117 votes491 views10 answers
Wattpad
C++
0 vote306 views1 answer
C++ qt QFuture
C++
1 vote259 views1 answer
How to fill all of the array in c++
C++