int primeJudge(int number) { int i; if (number < 2) return 0; else { for (i = 2; i <= sqrt((double)number); i++) { if (number % i == 0) return 0; } return 1; } }
