lin.c

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

#include "stdio.h"
#include "stdlib.h"
#include "iostream.h"
#define MAXSIZE 100
typedef int ElemType;
typedef struct
{
 ElemType elem[MAXSIZE];
 int      last;
 }SeqList;
int insert_SeqList(SeqList*L,int x)
 {
  int i;
  if(L->last+1>MAXSIZE)return 0;
  L->last;                       
  i=L->last-1;
  while(L->elem[i]>x)
  {
    L->elem[i+1]=L->elem[i];
    i--;
  }
  L->elem[i+1]=x;
  return 1;
}
int merge(SeqList *L)
{
  int i;
  for(i=0;i<=L->last;i++)
     printf("%d",&(L->elem[i])) ;
  return 1;
}
void main()
{
  SeqList *l;
  l=(SeqList *)malloc(sizeof(SeqList)); 
  l->last=0;
  int x;
  char s;
  int i=0;
  printf("请输入递增数组以0结束':");
  
  while(i<=MAXSIZE-1)
 { 
   scanf("%d",&s);
      if(s==0)break;              
   l->elem[i]=s;
   l->last++;
    i++;
   if(i>MAXSIZE)
     {
       printf("数组以满，不能再插入元素");
       break;
     }
 }
   printf("请输入插入元素:");
  scanf("%d",&x);
  insert_SeqList(l,x);
  merge(l);
}