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 vote208 views1 answer
How to block the screen c++
C++
0 vote200 views1 answer
C++ loop trhought object
C++
3 votes197 views1 answer
Library imported for stl
C++
1 vote192 views1 answer
How to print 5 precision float in c++
C++
3 votes201 views2 answers
Fast Inverse Square Root
C++
1 vote208 views1 answer
Call by value in c++
C++
5 votes151 views4 answers
Int length c++
C++
0 vote220 views1 answer
How to remove maximum number of characters in c++ cin,ignore
C++
0 vote207 views1 answer
C++ client service ros
C++
1 vote196 views1 answer
Cpp code for euclids GCD
C++