數(shù)據(jù)結(jié)構(gòu)實(shí)訓(xùn)報(bào)告王瑩瑩

1、排序算法的實(shí)考核項(xiàng)考核內(nèi)得（20）排序算法的實(shí)考核項(xiàng)考核內(nèi)得（20）（20）（15分）回答老師針對(duì)課程設(shè)問課程設(shè)撰（10）（5）總 指導(dǎo)教師評(píng)語日期目錄1課程設(shè)計(jì)目標(biāo)與任1.1課程設(shè)計(jì)目1.2課程設(shè)計(jì)目錄1課程設(shè)計(jì)目標(biāo)與任1.1課程設(shè)計(jì)目1.2課程設(shè)計(jì)任1.3 課程設(shè)計(jì)基本要2分析與設(shè)題目需求分結(jié)構(gòu)設(shè)關(guān)鍵算法描程序流程程序測(cè)試說3測(cè)3.1測(cè)試數(shù)分4總參考文附1程設(shè)計(jì)目標(biāo)與任1.1程設(shè)計(jì)目1.2程設(shè)計(jì)任1程設(shè)計(jì)目標(biāo)與任1.1程設(shè)計(jì)目1.2程設(shè)計(jì)任1.3 課程設(shè)計(jì)基本要計(jì)2析與設(shè)2.1目需求分結(jié)構(gòu)設(shè)性表中數(shù)據(jù)間的邏輯關(guān)系#include LIST_INIT_SIZE#define LISTINCR

2、EMENTtypedef struct 關(guān)鍵算法描2析與設(shè)2.1目需求分結(jié)構(gòu)設(shè)性表中數(shù)據(jù)間的邏輯關(guān)系#include LIST_INIT_SIZE#define LISTINCREMENTtypedef struct 關(guān)鍵算法描個(gè)個(gè)voidInsertSort(elemR/ for(i=2;i=n;+iR0=for(j=i-1;R0Rj;-jRj+1= Rj+1=/voidBInsertSort (elemR/ for(i=2;i=n;+iR0/ Rilow = high=i-while( low= / high=m-m =if(R0else lowvoidBInsertSort (elemR

3、/ for(i=2;i=n;+iR0/ Rilow = high=i-while( low= / high=m-m =if(R0=high+1;-jRj+1= Rj; Rhigh+1=R0; /進(jìn)行一次直排序void Insert(elem Rdk/ R for(i=dk+1;i=n;+i) if ( Ri Ri-dk)voidSort(elemRd / d0.t-1L for(k=0;k0&R0Rj;j-Rj+dk后移,Rj+dk=voidBubbleSort(elemRii while (ifor(voidBubbleSort(elemRii while (ifor(j=1; ji; j+

4、if(R j+1 RjSwap(Rj,Rj+1/Partition(Elem / / 在位置，此時(shí)，在它之前（后）/ R0=pivotkeyRlow; / while / while(lowhigh&/ Rlow =while(lowhigh&Rhigh/ RlowR0; / returnlow; / /voidQSort(Elem/ if(low / pivotloc=Partition(L,low,/ L.rlow.high一分為二 QSort(L, low, pivotloc-1);/ 對(duì)低子表遞歸排序，pivotloc QSort(L,pivotloc+1, / pivotloc=Pa

5、rtition(L,low,/ L.rlow.high一分為二 QSort(L, low, pivotloc-1);/ 對(duì)低子表遞歸排序，pivotloc QSort(L,pivotloc+1,/ /序列中選擇關(guān)鍵碼最小并將它與序列中的第一個(gè)并為VoidSelectSort(SqListfor(i=1;iL.length;+i)/i小的 L.rj;/i /2.422.5161 switch 語句，將執(zhí)行直接2.422.5161 switch 語句，將執(zhí)行直接33.1試數(shù)分1 2 當(dāng)輸入33.1試數(shù)分1 2 當(dāng)輸入3 時(shí)，調(diào)排序，對(duì)數(shù)組進(jìn)行了從小到大5 65 66 744參考文1c 數(shù)據(jù)結(jié)構(gòu)（C

6、 語言版數(shù)據(jù)結(jié)構(gòu)-C 參考文1c 數(shù)據(jù)結(jié)構(gòu)（C 語言版數(shù)據(jù)結(jié)構(gòu)-C （C 語言版） 王國c ,（美附MAXE 類型KeyType /InfoType /*關(guān)鍵字項(xiàng)/*length);/length);/BInsertSort (RecType SSort(RecType bubble_sort(RecType (RecType void QuickSort(RecType R, SelectMinKey(RecTypeR,SelectSort(RecType length);/showSort(RecTypeR);/快速排序 showSort_F(RecType R);RecTypeRMAXE

7、; f(選擇排序方法f(1.附MAXE 類型KeyType /InfoType /*關(guān)鍵字項(xiàng)/*length);/length);/BInsertSort (RecType SSort(RecType bubble_sort(RecType (RecType void QuickSort(RecType R, SelectMinKey(RecTypeR,SelectSort(RecType length);/showSort(RecTypeR);/快速排序 showSort_F(RecType R);RecTypeRMAXE; f(選擇排序方法f(1.f(2.排序排序排序f(4.起泡排序f(5

8、.快速排序f(6.簡單選擇排f(11: f(隨機(jī)數(shù)經(jīng)直排序后f(f(f(f(f(return void InsertSort(RecType aif(Ri.keyRi-R0.key=Ri.key; Ri.key=Ri-for(j=i-2;R0.keyRj.key;-Rj+1.key=Rj.key; 1: f(隨機(jī)數(shù)經(jīng)直排序后f(f(f(f(f(return void InsertSort(RecType aif(Ri.keyRi-R0.key=Ri.key; Ri.key=Ri-for(j=i-2;R0.keyRj.key;-Rj+1.key=Rj.key; Rj+1.key=R0.key;

9、void BInsertSort (RecType for i=2; i=length; +i R0.key=Ri.key; low = 1;high = i-Ri(low = Rlow.high=(R0.key=high+1;-j Rj+1.key = Rj.key; Rhigh+1.key = )for i=2; i=length; +i R0.key=Ri.key; low = 1;high = i-Ri(low = Rlow.high=(R0.key=high+1;-j Rj+1.key = Rj.key; Rhigh+1.key = ) / void Sort(RecTypeRecT

10、ype n) 排序算法while(d0)/*dfor (i=d;i=0 & 各組當(dāng)前有序區(qū)中/*RjRj+d交換,d); /*輸出每一趟的排序結(jié)果for /*void bubble_sort(RecType a for(i=0;ilength-void QuickSort(RecType ;-(RecType void bubble_sort(RecType a for(i=0;ilength-void QuickSort(RecType ;-(RecType return high;SelectMinKey(RecType ai.lengthkeyk=i;iif(Rj.keymin)return void SelectSort(RecType afor(i=0