a.cpp

用数据结构编写的对递增数组的有序插入

#include "stdio.h"
#include "stdlib.h"
#include "iostream.h"
typedef int ElemType;
typedef int status;
typedef struct Node
{
 ElemType data;
 struct Node *next;
 }Node,*LinkList;
LinkList Creat_LinkList()
{
	LinkList L;
	Node *s,*r;
	int flag=1;
    int c;
	L=(Node*)malloc(sizeof(Node));
	L->next=NULL;
	r=L;
	while(flag)
	{
	 scanf("%d",&c);
	 if(c!=0)
	 {
	 s=(Node*)malloc(sizeof(Node));
	 s->data=c;
	 r->next=s;
	 r=s;
	 }
	 else
	 {
	  flag=0;
	  r->next=NULL;
	 }
	}
	return L;
}

status Insert_Link(LinkList L,ElemType e)
{
 Node *pre,*s;
 pre=L;
 while(pre->next->data<=e)
 {
	pre=pre->next;
 }
    s=(Node*)malloc(sizeof(Node));
    s->data=e;
    s->next=pre->next;
    pre->next=s;
    return 1;
}

int main()
{ 
  int e;
  LinkList L;
  printf("请输入递增链表，以0结束");
  L=Creat_LinkList();
  printf("请输入插入元素：");
  scanf("%d",&e);
  Insert_Link(L,e);
  Node *p;
  p=L->next;
  while(p!=NULL)
  {
    cout<<" "<<p->data<<" ";
	p=p->next;
  }
  return 1;
}