C語言經典演算法：求1-100之間素數

#include<stdio.h>#include<stdlib.h>#include<assert.h>#include<math.h>int prime(int n)//素數除了1和它本身不能被其他數整除{assert(n > 0);int i = 0;for (i = 2; i <= sqrt(n); i++){if (n%i == 0){return 0;}}return 1;}int main(){int i = 0;int count = 0;printf("1-100之間的素數從小大為;\n");for (i = 2; i < 100; i++) //依次判斷是否為素數{if (prime(i)){count++;   //統計素數的個數printf("%d\t", i);}}printf("\n一共有%d個\n", count);system("pause");return 0;}