/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 vote95 views1 answer
Generate random ints and floats
C++
0 vote112 views1 answer
C++ declare binary number
C++
0 vote116 views1 answer
Switch cout print with a prameter c++
C++
1 vote108 views1 answer
Stock a file in a vector cpp
C++
-1 vote102 views1 answer
Pointer to constant
C++
0 vote98 views1 answer
C++ convert integer to digits, as vector
C++
0 vote164 views1 answer
How to analyse a poem
C++
0 vote105 views1 answer
Leetcode fast io
C++
0 vote117 views1 answer
Inpout in Array c++
C++
0 vote107 views1 answer
Why ostream cannot be constant
C++