ch07s001.c

稀疏矩阵、链表、图、队列、二叉树、多叉树、排序、遗传算法等的实现

#include <stdio.h>

int main(void)
{
  unsigned int count = 0;
  while(getchar() != EOF)
  {
    ++count;
  }
  printf("Character count is %u\n", count);
  return 0;
}