how to check if a number is prime c++

Yucky Yak answered on September 17, 2021 Popularity 9/10 Helpfulness 5/10

answer how to check if a number is prime c++

related fast way to check if a number is prime C++

how to check if a number is prime c++

Comment

bool isPrime(int number){

    if(number < 2) return false;
    if(number == 2) return true;
    if(number % 2 == 0) return false;
    for(int i=3; (i*i)<=number; i+=2){
        if(number % i == 0 ) return false;
    }
    return true;

}

Popularity 9/10 Helpfulness 5/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Nov 17 2021

Yucky Yak

0 Answers Avg Quality 2/10

Closely Related Answers

fast way to check if a number is prime C++

Comment

//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;
}

Popularity 8/10 Helpfulness 5/10 Language cpp

Source: stackoverflow.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Sep 17 2021

Glamorous Gibbon

0 Answers Avg Quality 2/10

how to check if a number is prime c++

Contents

More Related Answers

how to check if a number is prime c++

Closely Related Answers

fast way to check if a number is prime C++

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.