/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 vote348 views1 answer
All permutations with repetition C++
C++
0 vote368 views1 answer
Left margin c++
C++
10 votes315 views3 answers
C++ int to char*
C++
-1 vote313 views1 answer
51 13 C:\Users\usuario\Documents\Destajo 1.cpp [Error] 'gotoxy' was not declared in this scope
C++
0 vote316 views1 answer
Counting Sort C++
C++
0 vote348 views1 answer
Error C2011
C++
14 votes328 views2 answers
How to sort in descending order in c++
C++
1 vote332 views1 answer
Sum of stack c++
C++
26 votes324 views2 answers
Remove element from vector on condition c++
C++
0 vote313 views1 answer
C++ qt QFuture
C++