【C语言】朴素方式求小于1000以内的素数

//若n是素数则返回0，否则返回1
int is_prime(int n) {
  switch (n) {
  case 2:
  case 3:
  case 5:
  case 7:
  case 11:
  case 13:
  case 17:
  case 19:
  case 23:
  case 29:
  case 31:
  case 37:
  case 41:
  case 43:
  case 47:
    return 0;
  default:
    for (int i = 2; i <= n / 2; i++) {
      if (n % i == 0) {
        return 1;
      }
    }
  }

  return 0;
}