ch08_05.c

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

/* Listing 8.5 */

  FOO f = {0};
  FOO *p;

  p = malloc(n * sizeof *p);
  if(p != NULL)
  {
    for(i = 0; i < N; i++)
      p[i] = f;
  }