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 vote247 views1 answer
Quicksort taking random pivot
C++
-1 vote185 views1 answer
How to insert all values from one vector to another
C++
0 vote236 views1 answer
How to get window size sfml
C++
1 vote228 views1 answer
Get the element at an index list c++
C++
0 vote245 views1 answer
C++ compare time
C++
0 vote234 views1 answer
Entering char in int c++ avoid loop
C++
0 vote241 views2 answers
Qpushbutton clicked connect c++
C++
0 vote228 views1 answer
Character array to string c++ stl
C++
-1 vote228 views5 answers
C++ string split
C++
0 vote218 views1 answer
Binary search c++
C++