int Prime::find_prime(int size)
{
int *array=newint[size];
int counter=0;
for (int i=2; i<size; i++)
for (int j=2; j*j<=i; j++)
{
if (i % j == 0)
break;
elseif (j+1 > sqrt(i))
{
cout<<i<<" ";
counter++;
if (counter%10==0) //print 10 number per line
cout<<endl;
}
}
}