数据结构实验C语言实现排序

1、实验课题一：【用C描述课本的同学】有以下结构体构成的数组：struct StudentInfochar ID10;char * name;float score;StuInfo12=, JACK, 95, LUN, 85, MARY, 75.5, KATE, 78.9, LILI, 88, JACK, 96, JAN, 98.4, SAM, 75, OSCAR, 64, JACK, 97, ZOE, 68.9, BOBI, 87.6 ; 1 使用直接插入的排序方法按照学号的顺序对以上数组进行排序（递增）；2 分别用归并排序和快速排序按照姓名的顺序对以上数组进行排序（递增），有3人的名字是JAC

2、K，注意观察排序是否稳定。程序1#include#include#includetypedef struct StudentInfo ElementType;struct StudentInfochar ID11;char *name;double score;StuInfo12=,JACK,95,LUN,85,MARY,75.05,KATE,78.9,LILI,88,JACK,96,JAN,98.4,SAM,75,OSCAR,64,JACK,97,ZOE,68.9,BOBI,87.6;void InsertionSort(ElementType A,int N)int j,P;Element

3、Type Tmp;for(P=1;P0&strcmp(Aj-1.ID,Tmp.ID)0;j-)Aj=Aj-1;Aj=Tmp;void InsertionSort2(ElementType A,int N)int j,P;ElementType Tmp;for(P=1;P0&strcmp(A,T)0;j-)Aj=Aj-1;Aj=Tmp;void Merge (ElementType A,ElementType TmpArray,int Lpos,int Rpos,int RightEnd)int i,LeftEnd,NumElements,Tmpos;LeftEnd

4、=Rpos-1;Tmpos=Lpos;NumElements=RightEnd-Lpos+1;while(Lpos=LeftEnd&Rpos=RightEnd)if(strcmp(AL,AR)=0)TmpArrayTmpos+=ALpos+;elseTmpArrayTmpos+=ARpos+;while(Lpos=LeftEnd)TmpArrayTmpos+=ALpos+;while(Rpos=RightEnd)TmpArrayTmpos+=ARpos+;for(i=0;iNumElements;i+,RightEnd-)ARightEnd=TmpArrayRi

5、ghtEnd;void MSort(ElementType A,ElementType TmpArray,int Left,int Right)int center;if(Left0)Swap(&ALeft,&ACenter);if(strcmp(AL,AR)0)Swap(&ALeft,&ARight);if(strcmp(AC,AR)0)Swap(&ACenter,&ARight);Swap(&ACenter,&ARight-1);return ARight-1;#define Cutoff 3void Qsort(El

6、ementType A,int Left,int Right)int i,j;ElementType Pivot;if(Left+Cutoff=Right)Pivot=Median3(A,Left,Right);i=Left;j=Right-1;for(;)while(strcmp(A+,P)0)if(ij)Swap(&Ai,&Aj);elsebreak;Swap(&Ai,&ARight-1);Qsort(A,Left,i-1);Qsort(A,i+1,Right);elseInsertionSort2(A+Left,Right-Left+1);void Prin

7、tInfo()int i;printf( 学号ID 姓名 分数n);for(i=0;i12;i+)printf(%-15s,StuInfoi.ID);printf(%-10s,StuI);printf(%.1fn,StuInfoi.score);void main()printf(原顺序为：nn);PrintInfo();printf(用插入法排序为：nn);InsertionSort(StuInfo,12);PrintInfo();printf(用归并法排序为：nn);Mergsort(StuInfo,12);PrintInfo();printf(用快速法排序为：nn);Q

8、sort(StuInfo,0,11);PrintInfo();程序2#include#include#include#include#define Cutoff (3)struct StudentInfochar ID10;char * name;double score;StuInfo12=, JACK, 95, LUN, 85, MARY, 75.5, KATE, 78.9, LILI, 88, JACK, 96, JAN, 98.4, SAM, 75, OSCAR, 64, JACK, 97, ZOE, 68.9, BOBI, 87.6 ,; void InsertionSort(str

9、uct StudentInfo A,int N)int j,p;struct StudentInfo Tmp; for(p=1;p0&strcmp(Aj-1.ID,Tmp.ID)0 ; j-)Aj=Aj-1;Aj=Tmp;void InsertionSort1(struct StudentInfo A,int N)int j,p;struct StudentInfo Tmp; for(p=1;p0&strcmp(A,T)0 ; j-)Aj=Aj-1;Aj=Tmp;void Merge(struct StudentInfo A,struct StudentInfo

10、TmpArray,int Lpos,int Rpos,int RightEnd)int i,LeftEnd,NumElements,TmpPos;LeftEnd=Rpos-1;TmpPos=Lpos;NumElements=RightEnd-Lpos+1;while(Lpos=LeftEnd & Rpos=RightEnd)if(strcmp(AL,AR)=0)TmpArrayTmpPos+=ALpos+;elseTmpArrayTmpPos+=ARpos+;while(Lpos=LeftEnd)TmpArrayTmpPos+=ALpos+;while(Rpos

11、=RightEnd)TmpArrayTmpPos+=ARpos+; for(i=0;iNumElements;i+,RightEnd-)ARightEnd=TmpArrayRightEnd;void MSort(struct StudentInfo A,struct StudentInfo TmpArray,int Left,int Right)int Center;if(Left0) Swap(&ALeft,&ACenter); if(strcmp(AL,AR)0) Swap(&ALeft,&ARight); if(strcmp(AC,A

12、R)0) Swap(&ACenter,&ARight); Swap(&ACenter,&ARight-1); return ARight-1;void Qsort(struct StudentInfo A,int Left,int Right)int i,j; struct StudentInfo Pivot,Tmp;if(Left+Cutoff=Right)Pivot=Median3(A,Left,Right);i=Left;j=Right-1;for(;)while(strcmp(A+,P)0)if(ij) Swap(&Ai,&Aj); Tm

13、p=Ai;Ai=Aj;Aj=Tmp;elsebreak;Swap(&Ai,&ARight-1); Qsort(A,Left,i-1);Qsort(A,i+1,Right); InsertionSort1(A+Left,Right-Left+1);void Quicksort(struct StudentInfo A,int N)Qsort(A,0,N-1);void main()int i=0;InsertionSort(StuInfo,12); for(i=0;i12;i+)printf(%s,%s,%0.1fn,StuInfoi.ID,StuI,StuInfoi.score);printf(nn); Merg