ch08_03.c

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

/* Listing 8.3 */

  static char *buffer = NULL;
  static size_t bufsize = 0;
  while(strlen(s) >= bufsize)
  
    p = realloc(buffer, bufsize * 2);
    if(p != NULL)
    {
      bufsize *= 2;
      buffer = p;
    }
    else
    {
      printf("er...now what?\n");
    }
  }