C语言：通过素数互素原理输出前n个素数（数组方法实现）

#include <stdio.h>
#define number 100
int isPrime(int x,int knownPrimes[],int numberOfKnownPrimes);
int main(){
	int prime[number] = {2};
	int count = 1;
	int i =3;
	while (count < number) {
		if (isPrime(i,prime,count)){
			prime[count++] = i;
		}
		i++;
	}
	for (i=0;i<number;i++){
		printf("%d",prime[i]);
		if((i+1)%5 != 0) printf("\t");
		else printf("\n");
	}
	return 0;
}
int isPrime(int x,int knownPrimes[],int numberOfKnownPrimes)
{
	int ret = 1;
	int i;
	for (i=0;i<numberOfKnownPrimes;i++){
		if ((x % knownPrimes[i]) == 0){
			ret = 0;
			break;
		}
	}
	return ret;
}