习题06-有序链表插入元素.c

数据结构各章实验源代码； 数据结构实验源代码

#include  "datastru.h"
#include  <stdio.h>
#include  <malloc.h>

inser_order(DATATYPE2 x, LINKLIST *head){
/*将给定值x插入有序表中，并保持有序*/
  LINKLIST *pr, *pn, *pp;

  pr = head; pn = head->next;
  while(pn != NULL && pn->data < x)
   {pr = pn;
    pn = pn->next;}
  pp = (LINKLIST *)malloc(sizeof(LINKLIST));
  pp->data = x;
  pp->next = pr->next;
  pr->next = pp;
}

int count_head(LINKLIST *head){
/*带头结点的单链表：输出单链表元素值并计数*/
  int i = 0;
  LINKLIST *p;
  p = head->next;
  printf("输出单链表元素值 : ");
  while(p != NULL)
   {printf("  %c",p->data);
    i++;
    p = p->next;}
  printf("\n");
  return i;
}

LINKLIST *creatlink_order_head(LINKLIST *head)
/*建立带头结点的有序单链表*/
{ LINKLIST *t, *p, *q;
  char ch;

  t = (LINKLIST *)malloc(sizeof(LINKLIST));
  head = t;  t->next = NULL;
  printf("单链表元素值为单个字符, 连续输入，$为结束字符  : ");
  while ((ch = getchar()) != '$')
   {t = (LINKLIST *)malloc(sizeof(LINKLIST));
    t->data = ch;
    q = head;  p = head->next;
    while( p != NULL && p->data <= ch) {
	q = p;  p = p->next;}
    q->next = t; t->next = p;
   }
  return(head);
}

main()
{
  LINKLIST *head = NULL;
  int  num;
  char ch;

  printf("\n    建立单链表\n\n");
  head = creatlink_order_head(head);
  fflush(stdin);
  num = count_head(head);
  printf("单链表元素个数 = %d\n", num);
  printf("\n输入插入元素值 : ");
  ch = getchar();
  inser_order(ch, head);
  printf("\n    元素插入后\n\n");
  num = count_head(head);
  printf("插入后单链表元素个数 = %d\n", num);
}