求助，这个和欧筛哪个快

int p[100005] = {2};
bool j(int n)
{
	static int m = 0;
	for(int i = 0; i <= m && p[i] * p[i] <= n; ++i)
		if(n % p[i] == 0) return false;
	p[++m] = n;
	return true;
}