Prime numbers

One method to find prime numbers is Sieve of Eratosthenes :http://en.wikipedia.org/wiki/Sieve_of_eratosthenes

void sieve_prime(int n, bool prime[])
{
	prime[0] = false;
	prime[1] = false;
	int m = sqrt((double)n);

	for(int i=2; i<n; i++)
	{
		prime[i] = true;
	}
	for(int i=2; i<=m; i++)
	{
		for(int j=i*i; j<n; j+=i)
		{
			if(prime[j]==true)
			{
				prime[j] = false;
			}
		}
	}
}