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 vote183 views1 answer
Fractional Knapsack problem
C++
0 vote192 views1 answer
Call of overloaded ‘swap(int&, int&)’ is ambiguous
C++
1 vote179 views1 answer
Matrix layout in C++
C++
0 vote155 views1 answer
Recuva recovery software for pc with crack
C++
0 vote177 views1 answer
C++ if else if
C++
1 vote198 views1 answer
Shout sharkest
C++
-1 vote181 views1 answer
Standard input c++
C++
2 votes188 views1 answer
Print a string with printf in c++
C++
17 votes183 views2 answers
Convert string to char c++
C++
0 vote177 views1 answer
Max two numbers c++
C++