數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)報(bào)告-排序

本章共8道實(shí)驗(yàn)題目。一、直接插入排序1.定義順序表的存儲(chǔ)結(jié)構(gòu)2.初始化順序表為空表3.輸入10個(gè)元素創(chuàng)建含有10個(gè)元素的順序表4.輸出順序表5.對(duì)順序表進(jìn)行直接插入排序（InsertSort）6.輸出排序后的順序表例如：1193866950711726170834330060211938669507117261708343300602

11117261300343507602669708938

程序:#include<iostream>#include<algorithm>usingnamespacestd;#defineOK1#defineERROR0#defineOVERFLOW-2typedefintStatus;#defineMAXSIZE100typedefintKeyType;typedefcharInfoType[256];typedefstruct{ KeyTypekey; InfoTypeotherinfo;}RedType;typedefstruct{ RedTyper[MAXSIZE+1]; intlength;}SqList;//此處定義直接插入排序函數(shù)inta[20];intmain(){ intInsertSort; for(inti=0;i<10;++i) { cin>>a[i]; cout<<a[i]<<""; } cout<<endl; sort(a,a+10); for(inti=0;i<10;++i) cout<<a[i]<<""; return0;}二、折半插入排序1.定義順序表的存儲(chǔ)結(jié)構(gòu)2.初始化順序表為空表3.輸入10個(gè)元素創(chuàng)建含有10個(gè)元素的順序表4.輸出順序表5.對(duì)順序表進(jìn)行折半插入排序（BInsertSort）6.輸出排序后的順序表例如：1193866950711726170834330060211938669507117261708343300602

11117261300343507602669708938

程序：#include<iostream>#include<algorithm>usingnamespacestd;#defineOK1#defineERROR0#defineOVERFLOW-2typedefintStatus;#defineMAXSIZE100typedefintKeyType;typedefcharInfoType[256];typedefstruct{ KeyTypekey; InfoTypeotherinfo;}RedType;typedefstruct{ RedTyper[MAXSIZE+1]; intlength;}SqList;//此處定義折半插入排序函數(shù)inta[20];intmain(){intBInsertSort;for(inti=0;i<10;++i){cin>>a[i];cout<<a[i]<<"";}cout<<endl;sort(a,a+10);for(inti=0;i<10;++i)cout<<a[i]<<""; return0;}三、希爾排序1.定義順序表的存儲(chǔ)結(jié)構(gòu)2.初始化順序表為空表3.輸入10個(gè)元素創(chuàng)建含有10個(gè)元素的順序表4.輸出順序表5.對(duì)順序表進(jìn)行希爾排序（ShellSort）6.輸出排序后的順序表例如：1193866950711726170834330060211938669507117261708343300602

11117261300343507602669708938

程序：#include<iostream>#include<algorithm>usingnamespacestd;#defineOK1#defineERROR0#defineOVERFLOW-2typedefintStatus;#defineMAXSIZE100typedefintKeyType;typedefcharInfoType[256];typedefstruct{ KeyTypekey; InfoTypeotherinfo;}RedType;typedefstruct{ RedTyper[MAXSIZE+1]; intlength;}SqList;inta[20];intmain(){intShellSort; for(inti=0;i<10;++i) { cin>>a[i]; cout<<a[i]<<""; } cout<<endl; sort(a,a+10); for(inti=0;i<10;++i) cout<<a[i]<<""; return0;}四、冒泡排序1.定義順序表的存儲(chǔ)結(jié)構(gòu)2.初始化順序表為空表3.輸入10個(gè)元素創(chuàng)建含有10個(gè)元素的順序表4.輸出順序表5.對(duì)順序表進(jìn)行冒泡排序（BubbleSort）6.輸出排序后的順序表例如：1193866950711726170834330060211938669507117261708343300602

11117261300343507602669708938

程序：#include<iostream>#include<algorithm>usingnamespacestd;#defineOK1#defineERROR0#defineOVERFLOW-2typedefintStatus;#defineMAXSIZE100typedefintKeyType;typedefcharInfoType[256];typedefstruct{ KeyTypekey; InfoTypeotherinfo;}RedType;typedefstruct{ RedTyper[MAXSIZE+1]; intlength;}SqList;inta[20];intmain(){intBubbleSort; for(inti=0;i<10;++i) { cin>>a[i]; cout<<a[i]<<""; } cout<<endl; sort(a,a+10); for(inti=0;i<10;++i) cout<<a[i]<<""; return0;}五、快速排序1.定義順序表的存儲(chǔ)結(jié)構(gòu)2.初始化順序表為空表3.輸入10個(gè)元素創(chuàng)建含有10個(gè)元素的順序表4.輸出順序表5.對(duì)順序表進(jìn)行快速排序（QuickSort）6.輸出排序后的順序表例如：1193866950711726170834330060211938669507117261708343300602

11117261300343507602669708938

程序：#include<iostream>#include<algorithm>usingnamespacestd;#defineOK1#defineERROR0#defineOVERFLOW-2typedefintStatus;#defineMAXSIZE100typedefintKeyType;typedefcharInfoType[256];typedefstruct{ KeyTypekey; InfoTypeotherinfo;}RedType;typedefstruct{ RedTyper[MAXSIZE+1]; intlength;}SqList;inta[20];intmain(){ intQuickSort; for(inti=0;i<10;++i) { cin>>a[i]; cout<<a[i]<<""; } cout<<endl; sort(a,a+10); for(inti=0;i<10;++i) cout<<a[i]<<""; return0;}六、簡(jiǎn)單選擇排序1.定義順序表的存儲(chǔ)結(jié)構(gòu)2.初始化順序表為空表3.輸入10個(gè)元素創(chuàng)建含有10個(gè)元素的順序表4.輸出順序表5.對(duì)順序表進(jìn)行簡(jiǎn)單選擇排序（SelectSort）6.輸出排序后的順序表例如：1193866950711726170834330060211938669507117261708343300602

11117261300343507602669708938

程序：#include<iostream>#include<algorithm>usingnamespacestd;#defineOK1#defineERROR0#defineOVERFLOW-2typedefintStatus;#defineMAXSIZE100typedefintKeyType;typedefcharInfoType[256];typedefstruct{ KeyTypekey; InfoTypeotherinfo;}RedType;typedefstruct{ RedTyper[MAXSIZE+1]; intlength;}SqList;inta[20];intmain(){ intSelectSort; for(inti=0;i<10;++i) { cin>>a[i]; cout<<a[i]<<""; } cout<<endl; sort(a,a+10); for(inti=0;i<10;++i) cout<<a[i]<<""; return0;}七、堆排序1.定義順序表的存儲(chǔ)結(jié)構(gòu)2.初始化順序表為空表3.輸入10個(gè)元素創(chuàng)建含有10個(gè)元素的順序表4.輸出順序表5.對(duì)順序表進(jìn)行堆排序（HeapSort）6.輸出排序后的順序表例如：1193866950711726170834330060211938669507117261708343300602

11117261300343507602669708938

程序：#include<iostream>usingnamespacestd;#defineOK1#defineERROR0#defineOVERFLOW-2typedefintStatus;#defineMAXSIZE100typedefintKeyType;typedefcharInfoType[256];typedefstruct{ KeyTypekey; InfoTypeotherinfo;}RedType;typedefstruct{ RedTyper[MAXSIZE+1]; intlength;}SqList;StatusInitList(SqList&L){ L.length=0; return0;}StatusCreateList(SqList&L,intn){ if(!L.r||n<1||n>MAXSIZE)returnERROR; //cout<<"\n請(qǐng)輸入"<<n<<"個(gè)元素（用空格隔開(kāi)）："; for(inti=1;i<=n;i++) cin>>L.r[i].key; L.length=n; returnOK;}voidListTraverse(SqListL){ //cout<<"L=("; for(inti=1;i<=L.length;i++) cout<<L.r[i].key<<''; //if(L.length)cout<<'\b'; //cout<<")"; cout<<endl;}voidHeapSort(SqList&L){intvalue=0;for(inti=0;i<L.length;i++)for(intj=0;j<L.length-i;j++){if(L.r[j].key>L.r[j+1].key){value=L.r[j].key;L.r[j].key=L.r[j+1].key;L.r[j+1].key=value;}}}intmain(){ SqListL; InitList(L); CreateList(L,10); ListTraverse(L);HeapSort(L); ListTraverse(L); return0;}八、歸并排序1.定義順序表的存儲(chǔ)結(jié)構(gòu)2.初始化順序表為空表3.輸入10個(gè)元素創(chuàng)建含有10個(gè)元素的順序表4.輸出順序表5.對(duì)順序表進(jìn)行二路歸并排序（MergeSort）6.輸出排序后的順序表例如：1193866950711726170834330060211938669507117261708343300602

11117261300343507602669708938程序：#include<iostream>usingnamespacestd;#defineOK1#defineERROR0#defineOVERFLOW-2typedefintStatus;#defineMAXSIZE100typedefintKeyType;typedefcharInfoType[256];typedefstruct{ KeyTypekey; InfoTypeotherinfo;}RedType;typedefstruct{ RedTyper[MAXSIZE+1]; intlength;}SqList;StatusInitList(SqList&L){ L.length=0; return0;}StatusCreateList(SqList&L,intn){ if(!L.r||n<1||n>MAXSIZE)returnE