/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 vote207 views2 answers
Private static c++
C++
0 vote206 views1 answer
Iterate const vector
C++
6 votes191 views1 answer
C++ estimate deciimal to a point
C++
1 vote189 views1 answer
File descriptor linux c++
C++
0 vote200 views1 answer
C++ unordered_map check if key exists
C++
1 vote271 views1 answer
Remove last index of the string in c++
C++
2 votes199 views1 answer
Arduino struct
C++
0 vote215 views3 answers
C++ comment
C++
0 vote228 views1 answer
Rotation 2d d'un point
C++
0 vote183 views1 answer
Transpose function example in c++
C++