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

9 votes413 views3 answers
Max function in c++
C++
0 vote318 views1 answer
C++ list of pairs
C++
0 vote328 views1 answer
Prime template c++
C++
1 vote338 views1 answer
Google spreadsheets add two strings
C++
0 vote342 views1 answer
Processing a string- CodeChef Solution in CPP
C++
0 vote356 views7 answers
Hexo
C++
1 vote388 views1 answer
Lpcwstr to string c++
C++
0 vote332 views1 answer
Basic stack implementation in c++
C++
1 vote340 views1 answer
Print 5 table in c++
C++
3 votes321 views2 answers
Access last element of set c++
C++