[BCZ-HEAP]堆排序的实现，包括建堆，siftup(主要用于建堆)和siftdown(主要用于调整)函数的实现

堆排序的实现，包括建堆，siftup(主要用于建堆)和siftdown(主要用于调整)函数的实现,注意siftdown函数中的推出循环的条件,别把break落下了

/******************************************************************* * * DESCRIPTION: 堆排序 - 连个重要的siftdown 和 siftup函数 O(N*logN) * * AUTHOR: Neesky * * DATE:2009-11-3 * *******************************************************************/ /** include files **/ #include <iostream> #include <iomanip> using namespace std; int heap[7]={3,2,1,4,5,6,7}; /** * Output Array Method * * @author NeeSky (2009-11-3) * * @param Arr * @param N */ void OutputArray(int Arr[],int N) { cout<<" "; for(int i=0;i<N;++i) cout<<heap[i]<<" "; cout<<endl; return; } /** * Siftup it ,which is i position [Core] * * @author NeeSky (2009-11-3) * * @param Heap * @param i */ void SiftUpOfHeap(int Heap[],int i) { int p=i; int father=(i+1)/2-1; while(Heap[p]>Heap[father]&&father>=0) { std::swap(Heap[p],Heap[father]); p=father; father=p/2; } return; } /** * Siftdown it,which is i position and end is tail [Core] * * @author NeeSky (2009-11-3) * * @param Heap * @param i * @param tail */ void SiftDownHeap(int Heap[], int i, int tail) { int p=i; int left=2*p+1,right=2*p+2; while(left<=tail) { if(right<=tail)/*left and right child are all existed*/ { int indexbig=Heap[left]>Heap[right]?left:right; if(Heap[indexbig]>Heap[p]) { std::swap(Heap[indexbig],Heap[p]); p=indexbig; left=2*p+1; right=2*p+2; }else break; /*break is important*/ }else if(Heap[p]<Heap[left])/*left existed,has no right child*/ { std::swap(Heap[p],Heap[left]); break; /*break is important*/ }else break; /*break is important*/ } return; } /** * Just Build the MaxHeap with Siftup Method * * @author NeeSky (2009-11-3) * * @param Arr * @param N */ void BuildMaxHeap(int Arr[],int N) { for(int i=1;i<N;++i) SiftUpOfHeap(Arr,i); return; } /** * Heap Sort Method * * @author NeeSky (2009-11-3) * * @param Arr * @param N */ void HeapSort(int Arr[],int N) { cout<<"Original Array :";OutputArray(Arr,7); BuildMaxHeap(Arr,N); cout<<"Build Max Heap :";OutputArray(heap,7); for(int i=N-1;i>=0;--i) { SiftDownHeap(heap,0,i); std::swap(Arr[0],Arr[i]);/*Arr[i] is being fixed*/ cout<<"ShiftDown "<<setw(2)<<N-i<<"-time:";OutputArray(heap,7); } return; } /** * The Main Programming * * @author NeeSky (2009-11-3) * * @param argc * @param argv * * @return int */ int main (int argc, char *argv[]) { HeapSort(heap,7); cout<<"Heap Sort Array :";OutputArray(heap,7); return(0); }

输出：

mingw32-make: Nothing to be done for `all'.

Debug/BeautifulCoding20091103.exe 

Original Array   : 3 2 1 4 5 6 7 

Build Max Heap   : 7 6 5 2 3 1 4 

ShiftDown  1-time: 4 6 5 2 3 1 7 

ShiftDown  2-time: 1 4 5 2 3 6 7 

ShiftDown  3-time: 3 4 1 2 5 6 7 

ShiftDown  4-time: 2 3 1 4 5 6 7 

ShiftDown  5-time: 1 2 3 4 5 6 7 

ShiftDown  6-time: 1 2 3 4 5 6 7 

ShiftDown  7-time: 1 2 3 4 5 6 7 

Heap Sort Array  : 1 2 3 4 5 6 7