二工大顺序表题目.docVIP

/* 源文件名：P1.cpp 功能：顺序表操作 */ #include iostream.h #include iomanip.h #include conio.h #include stdio.h #include process.h #include string.h #include math.h #include stdlib.h const max=10000; struct SqList { int elem[max]; //存放元素的数组 int length; //当前长度 }; void init(SqList list); void display(SqList list); void insert(SqList list); void search(SqList list); void del(SqList list); void simpleSort(SqList list); void QSort (SqList list,int low,int high); int quickSort1(SqList list,int low,int high); void quickSort(SqList list,int low,int high); void binarySearch(SqList list); void nzlist(SqList list); typedef int DataType; SqList list; void main() { char choice; while (1) { system(cls); cout \n\n\n\n; cout \t\t 静态线性表操作 \n; cout \t\t======================================; cout \n\n; cout \t\t 1：初始化 \n; cout \t\t 2：显示 \n; cout \t\t 3：插入 \n; cout \t\t 4：查找 \n; cout \t\t 5：删除 \n; cout \t\t 6：简单排序 \n; cout \t\t 7：快速排序 \n; cout \t\t 8：折半查找 \n; cout \n; cout \t\t 0：退出 \n; cout \n; cout \t\t请选择： flush; choice = getch(); system(cls); switch(choice) { case 1: init(list); break; case 2: display(list); break; case 3: insert(list); break; case 4: search(list); break; case 5: del(list); break; case 6: simpleSort(list); break; case 7: quickSort(list,0,list.length); break; case 8: binarySearch(list); break; case 0: exit(0); } } } //屏幕提示后，从键盘输入线性表长度和随机数种子，生成指定长度的线性表list void init(SqList list) { int i; while (1) { cout 输入元素个数（0－ max ）： flush; cin list.length; if(list.length = 0 list.length = max) break; cout endl; } while (1) { cout 输入随机数种子（0－32767）： flush; cin i; if (i = 0 i = 32767) break; cout end