I'm a rookie in data structures .今天上机实习了一下排序着一章向大家汇报。（drmao）

drmao 2003-10-27 09:01:03

//-----------DATA STRUCTURES-------//
//----------2003 10 26 ------------//
//==========BY DRMAO in ChangSha city---------------//
#include <iostream.h>
#include <stdio.h>
#include <stdlib.h>
#define KeyType int
#define InfoType char
#define MAXSIZE 24
#define Status int
typedef struct {
KeyType key;
InfoType info;
}RedType;
typedef struct{
RedType r[MAXSIZE+1];
int length;
}SqList;
/////////////////////////////////
Status Exchange(RedType &a,RedType &b){ //交换两个redType
RedType exchange; exchange=a; a=b; b=exchange; return 1;
}////////////////////////////////////////////////////////////////
Status InitSqList(SqList &A){int i=1;KeyType input;
for(;i<=MAXSIZE;++i){ cin>>input;
if(input) A.r[i].key=input; else break;
}A.length=i-1;
return 1;//初始化SqList
}////////////////////////////////////////////////////////////////
Status PrintSqList(SqList &A){int i=1; cout<<"\n"; for(;i<=A.length;++i) cout<<A.r[i].key<<" ";return 1;
}/////////////////////////////////////////////////
Status HeapAdjust(SqList &A,int i,int j){
int t; RedType temp=A.r[i],rs=A.r[i];
for(t=2*i;t<=j;t*=2){if(t<j&&(A.r[t].key<A.r[t+1].key)) ++t;
if(temp.key>=A.r[t].key)break;
else {A.r[i]=A.r[t]; i=t;}
}A.r[i]=rs;
return 1;///堆排序构造大顶堆
}///////////////////////////////////////
Status HeapSort(SqList &HS){
int i,len=HS.length/2; //RedType exchange;
for(i=len;i>0;--i) HeapAdjust(HS,i,HS.length);
for(i=HS.length;i>1;--i){
Exchange(HS.r[1],HS.r[i]);
HeapAdjust(HS,1,i-1);
} return 1;
}//////////////////////////////////
Status Partition(SqList &QS,int low,int high){ KeyType pivot;
QS.r[0]=QS.r[low]; pivot=QS.r[0].key;
while(low<high){
while((low<high)&&( pivot<=QS.r[high].key )) --high;
QS.r[low]=QS.r[high];
while((low<high)&&( pivot>=QS.r[low].key )) ++low;
QS.r[high]=QS.r[low];
}
QS.r[low]=QS.r[0]; PrintSqList(QS);
return low;
}//////////////////////////////////////////////
Status QSort(SqList &QS,int low,int high){//RedType temp,pivot=QS.r[low];
int i;
if(low<high){
i=Partition(QS,low,high);
QSort(QS,low,i-1); QSort(QS,i+1,high);
} return 1;
}///////////////////////////////////////QSort
Status QuickSort(SqList &QS){QSort(QS,1,QS.length);
return 1;
}///////////////////////////////////////////////////////
Status InsertSort(SqList &IS){ int i=2,j;
for(;i<=IS.length;++i){
if(IS.r[i].key<IS.r[i-1].key){ IS.r[0]=IS.r[i];
for(j=i-1;IS.r[j].key>IS.r[0].key;--j) IS.r[j+1]=IS.r[j];
IS.r[j+1]=IS.r[0]; } //end if;
} return 1;//直接插入排序。
}////////////////////////////////////////

int main(){SqList HS;
InitSqList(HS);PrintSqList(HS);
InsertSort(HS);PrintSqList(HS);

return 1;
}

...全文