/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

1 vote100 views1 answer
Print all chrchetrs of a string c++
C++
2 votes123 views2 answers
C++ length of char*
C++
0 vote110 views1 answer
Copy file to vector c++
C++
0 vote126 views1 answer
Inverse lerp c++
C++
4 votes114 views2 answers
Check uppercase c++
C++
0 vote118 views1 answer
How to use custom array in c++
C++
0 vote101 views1 answer
Abstraction in cpp
C++
0 vote111 views1 answer
Udo apt install dotnet-sdk-5 permission denied
C++
1 vote105 views3 answers
Google snake game
C++
1 vote116 views1 answer
C++ vector of class objects
C++