Find prime number c++

Prime number c++

template<class T> bool isPrime(T n) 
{ 
	T i;
  	if(i<2) return false;
	for(i = 2; i * i <= n; i++) { 
    	if(n % i == 0)  return false; 
    } 
	return true; 
}

Find prime number c++

#include <math.h>
// time: O(sqrt(n)) ..  space: O(1)
bool isPrime(int n) {
  if (n < 2) return false;
  int iter = 2;
  while(iter <= sqrt(n)) {
  	if (n % iter == 0) return false;
    iter++;
  }
  return true;
}

Similar codes

0 vote189 views1 answer
>> c++
C++
0 vote217 views1 answer
Find maximum sum of circular subarray
C++
0 vote190 views10 answers
Convert java code to c++ online
C++
0 vote199 views1 answer
SET TO NULL pointer c++
C++
4 votes200 views1 answer
C++ measure time of function
C++
0 vote248 views1 answer
Sprintf add two xeroes for a float number
C++
0 vote193 views1 answer
TCA9548 I2CScanner Arduino
C++
0 vote210 views1 answer
Sort using lambda c++
C++
0 vote191 views1 answer
C++ pause linux
C++
0 vote210 views1 answer
Oncomponentendoverlap ue4 c++
C++