筛选法求素数

//输入：数//输出：1->素数//      0->非素数int findPrime(int *number);int findPrime(int *number){    int num = *number;    int right = ( *number)/2+1;    int i, j;    int flag = 1;    for (i=2; i<=right; i++)    {        if (num%i==0) //num is not a primer        {            flag = 0;            break;        }    }    return flag;}