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 vote201 views1 answer
+++++++++
C++
0 vote185 views2 answers
C++ namespace example
C++
0 vote176 views1 answer
Size of set c++
C++
13 votes187 views5 answers
Max of a vector c++
C++
1 vote203 views1 answer
Qt label set text color
C++
1 vote187 views1 answer
Chess perft 5
C++
0 vote169 views1 answer
Niet werkend
C++
1 vote179 views1 answer
Ray sphere intersection equation
C++
1 vote184 views2 answers
Empty character constant error c++
C++
6 votes170 views3 answers
Convert set to vector c++
C++