/C++/Fast way to check if a number is prime C++

Fast way to check if a number is prime C++

//O(sqrt(n))
bool isPrime(int num){
    if(num <= 1) return false;
    for(int i = 2; i <= sqrt(num); i++){
          if(num % i == 0) return false;
    }
    return true;
}

-1

Source: stackoverflow.com

Similar codes

2 votes295 views1 answer
C++ custom compare in set
C++
7 votes278 views1 answer
How to check string contains char in c++
C++
0 vote259 views1 answer
C++ tab
C++
2 votes275 views1 answer
Suppress individual warnings in visual c++
C++
0 vote301 views1 answer
C++ sorting and keeping track of indexes
C++
0 vote275 views1 answer
Upcasting in c++
C++
0 vote274 views1 answer
Sum of n natural numbers in c
C++
1 vote280 views1 answer
Qt messagebox
C++
1 vote281 views2 answers
Maximum value in map in c++
C++
1 vote291 views2 answers
Ue4 array copy c++
C++