/C++/How to check if a number is prime c++

How to check if a number is prime c++

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;

}

Similar codes

0 vote187 views1 answer
How to implement binders and decorators on c++ lik python?
C++
0 vote165 views5 answers
Online c++ graphics compiler
C++
1 vote209 views1 answer
Remove () not working c++
C++
0 vote167 views1 answer
Sum of first and last digit of a number in C++
C++
0 vote163 views1 answer
What do I return in int main() function c++
C++
-1 vote186 views1 answer
Equal elements in two arrays in c++
C++
0 vote156 views1 answer
Reading package lists... Done Building dependency tree Reading state information... Done mysql-server is already the newest version (5.7.36-0ubuntu0.18.04.1). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.
C++
2 votes174 views2 answers
Random number generator c++ between 0 and 1
C++
0 vote167 views2 answers
How to use decrement operator in c++
C++
0 vote167 views2 answers
QVariant to int
C++