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

1 vote251 views10 answers
Js
C++
0 vote264 views1 answer
How to setup glut main loop
C++
20 votes291 views3 answers
How to append to a vector c++
C++
1 vote320 views1 answer
Calculate time difference cpp
C++
1 vote268 views1 answer
Sum of stack c++
C++
0 vote267 views1 answer
C++ getline doesn't wait for input
C++
0 vote249 views1 answer
CudaMalloc
C++
0 vote265 views1 answer
Reference variablesr in c++
C++
0 vote253 views1 answer
Ue4 set size of widget c++
C++
0 vote296 views1 answer
Binpow in fenwick tree
C++