/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 vote150 views1 answer
Std::ifstream cant read file to large
C++
-1 vote133 views1 answer
C++ set console title
C++
0 vote137 views1 answer
Registering a new QML type
C++
0 vote139 views1 answer
Transform c++
C++
-1 vote114 views1 answer
Longest increasing subsequence nlogn c++
C++
0 vote127 views1 answer
C++ program to find gcd of 3 numbers
C++
0 vote124 views1 answer
Vector of threads thread pool c++
C++
0 vote131 views1 answer
Play roblox vr on quest 2
C++
1 vote149 views1 answer
C++ functions inside functions
C++
6 votes128 views1 answer
C++ replace character in string
C++