heapsort.cpp

《数据结构》所有相关程序的算法。有图、数组以及二叉数的问题。附有程序及结果。

//HeapSort.cpp
//This function is to HeapSort SqList
# include <iostream.h>
# include <conio.h>
# define MAXSIZE 20
typedef int RedType;

typedef struct		//define structure SqList
{   RedType	r[MAXSIZE+1];
    int length;
}SqList;
typedef SqList HeapType;

void HeapAdjust(HeapType &H,int s,int m) //HeapAdjust() sub-function
{  int temp,j;
   temp=H.r[s];
   for(j=2*s;j<=m;j*=2)
   {  if(j<m&&(H.r[j]<H.r[j+1]))
	 ++j;
      if(!(temp<H.r[j]))
	 break;
      H.r[s]=H.r[j];
      s=j;
   }
   H.r[s]=temp;
} //HeapAdjust() end

void HeapSort(HeapType &H)      	//HeapSort() sub-function
{  int i,temp;
   for(i=H.length/2;i>0;--i)
      HeapAdjust(H,i,H.length);
   for(i=H.length;i>1;--i)
   {  temp=H.r[1];
      H.r[1]=H.r[i];
      H.r[i]=temp;
      HeapAdjust(H,1,i-1);
   }
} //HeapSort() end

void main()				//main() function
{  int i;
   HeapType H={{0,49,38,65,97,76,13,27,49},8};
   cout<<endl<<endl<<"HeapSort.cpp";
   cout<<endl<<"============"<<endl;
   cout<<endl<<"The disordered : ";
   for(i=1;i<=H.length;i++)
       cout<<H.r[i]<<"  ";
   HeapSort(H);				//call HeapSort()
   cout<<endl<<"The sorted     : ";
   for(i=1;i<=H.length;i++)
       cout<<H.r[i]<<"  ";
   cout<<endl<<endl<<"...OK!...";
   getch();
} //main() end