堆的简单实现,注意点和优化点还是比较多的,后面补充库的使用。
#include <iostream>
using namespace std;
void print(int *src, int len)
{
for(int i = 0; i < len; ++i)
cout << src[i] << " ";
cout << endl;
}
void prce_down(int *src, int parent, int len)
{
int tmp = src[parent];
for(int child=parent*2+1; child<len; child=2*child+1){
if(child+1<len && src[child]<src[child+1]){
++child;
}
if(src[parent] < src[child]){
//swap(src[parent],src[child]);
src[parent] = src[child];
parent = child;
}else{
break;
}
}
src[parent] = tmp;
}
void heap_sort(int *src, int len)
{
//先建立大顶堆 i 2*i+1 2*i+2
for(int i=len/2-1; i>=0; --i){
prce_down(src, i, len);
}
//print(src,len);
//进行排序
for(int i=len-1; i>0; --i){
swap(src[0], src[i]);
//将剩下的无序元素继续调整为大顶堆
prce_down(src,0,i);
}
}
int main()
{
int src[] = {33, 1, 3, 88, 6, 11, 2};
heap_sort(src, 7);
for(int i = 0; i < sizeof(src)/sizeof(src[0]); ++i)
cout << src[i] << " ";
cout << endl;
return 0;
}