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;
}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;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
