/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

1 vote171 views1 answer
Implementation of Extended Euclidian theorem
C++
0 vote170 views10 answers
Convert java code to c++ online
C++
0 vote156 views1 answer
Unreal engine c++ bind action to function with parameter
C++
0 vote216 views1 answer
Operand-- c++
C++
1 vote272 views1 answer
C++ vs c#
C++
0 vote170 views1 answer
C++ CHEAT SHEAT
C++
3 votes155 views1 answer
Initialzing a 2d vector in cpp
C++
1 vote170 views1 answer
C++ product of vector
C++
0 vote167 views2 answers
C++ uint8_t header
C++
19 votes163 views4 answers
How to get ipv4 address in php
C++