摘要:
//单链表的头插法和尾插法建立,以及直接插入法递增排序#include #include #include #define ElemType intusing namespace std;typedef struct List{ ElemType data; struct List *next;}List;void CreatListF(List *L,ElemType a[],int n){ List *s; L->next=NULL; int i; for(i=0;idata=a[i];s->next=L->next;L->next=s;}}void CreatLi 阅读全文