数据结构实训一(顺序表).doc

数据结构实训一（顺序表） #includestdio.h #includeconio.h//包含getch()函数 #includestdlib.h #define MAXSIZE 1000 //定义顺序表类型 typedef int ElemType; typedef struct{ ElemType data[MAXSIZE]; int length; }SeqList;//给顺序表类型起一个别名SeqList; //定义接口 int InputChoice();//选择函数 void InitList(SeqList *List);//初始化顺序表 void Display(SeqList List);//显示函数 void Insert(SeqList *List);//插入函数 void Search(SeqList List);//查找函数 void Delete(SeqList *List);//删除函数 void SimpleSort(SeqList List);//简单选择排序 int Partition(SeqList List,int left,int right);//快排分割调整 void QuickSort(SeqList *List,int left,int right);//快速排序 void BinarySearch(SeqList List);//折半查找 void Inveser(SeqList List);//逆置顺序表 void InsertSort(SeqList List);//直接插入排序 void BubbleSort(SeqList List);//冒泡排序 void OrderInsert(SeqList *List);//有序插入 void DeleteBetweenXY(SeqList *List);//删除介于X和Y之间的值 void MergeList(SeqList *List_1,SeqList *List_2,SeqList *List_3);//合并顺序表 void SplitList(SeqList *List_1,SeqList *List_2,SeqList *List_3);//拆分顺序表 void ShellSort(SeqList List);//希尔排序 void HeapAdjust(SeqList *List,int root,int length);//建立大顶堆 void HeapSort(SeqList List);//堆排序 void main() { int myChoice; SeqList List; SeqList List_1; SeqList List_2; SeqList List_3; while(1) { system(cls); myChoice=InputChoice(); switch(myChoice) { case 0: exit(0); break; case 1: InitList(List); break; case 2: printf(当前顺序表为：); Display(List); getch(); break; case 3: Insert(List); break; case 4: Search(List); break; case 5: Delete(List); break; case 6: SimpleSort(List); break; case 7: printf(排序前：); Display(List); QuickSort(List,0,List.length-1); printf(\n快速排序成功!\n由于能力有限,暂无法计算移动和比较次数...\n\n); printf(排序后：); Display(List); getch(); break; case 8: BinarySearch(List); break; case 9: Inveser(List); break; case 10: InsertSort(List); break; case 11: BubbleSort(List); break; case 12: OrderInsert(List); break; case 13: DeleteBetweenXY(List); break;