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 vote166 views1 answer
Can we create array inside an array in c++
C++
0 vote254 views1 answer
Cpp execute command
C++
-1 vote213 views1 answer
String array 2d c++
C++
19 votes210 views3 answers
File reading c++
C++
-1 vote208 views1 answer
Flags of open operation c++
C++
0 vote214 views2 answers
C++ bit shift wrap
C++
0 vote223 views1 answer
C++ hide credentials
C++
12 votes221 views3 answers
Declare vector of size n in c++
C++
0 vote219 views1 answer
InstallUtil.exe ConsoleApp
C++
9 votes225 views2 answers
Delete last char of string C++
C++