/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 vote360 views1 answer
Ex: java script
C++
0 vote365 views1 answer
C++ double is nan
C++
0 vote348 views1 answer
C++ print 3d cube
C++
1 vote282 views1 answer
Qt can't use ^ operator on qchar
C++
0 vote334 views3 answers
An array that take different data type c++
C++
0 vote308 views1 answer
Deifine an object in C++
C++
0 vote333 views1 answer
How can I delete a substring from a string in c++?
C++
0 vote358 views1 answer
Lambda function qt connect
C++
0 vote347 views1 answer
Emplace vs push c++
C++
1 vote322 views2 answers
Reverse sort cpp
C++