/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

-1 vote231 views1 answer
How to initialize static member variable of a class in c++
C++
0 vote242 views1 answer
C++ sort
C++
6 votes262 views6 answers
C++ sort vector
C++
2 votes226 views2 answers
C++ sum the digits of an integer
C++
0 vote239 views1 answer
Cpp how to add collisions to boxes
C++
0 vote229 views1 answer
C++, for-loop over an array array
C++
1 vote265 views1 answer
How to return char* from function in c++
C++
0 vote313 views1 answer
Deletion in bst
C++
3 votes246 views2 answers
C++ find string in string
C++
18 votes227 views4 answers
How to string to integer in c++
C++