class HeapSort{
public:
static void adjustHeap(vector<int> &vec, int pos, int len) {
auto tmp = vec[pos];//先取出当前元素i
for ( int k = pos * 2 + 1; k < len; k = k*2 + 1) {//从i结点的左子结点开始,也就是2i+1处开始
if ( k + 1 < len && vec[k] < vec[k+1] ){//如果左子结点小于右子结点,k指向右子结点
++k;
}
if ( tmp < vec[k] ){//如果子节点大于父节点,将子节点值赋给父节点(不用进行交换)
vec[pos] = vec[k];
pos = k;
}else {
break;
}
}
//cout<<tmp<<" "<<pos<<endl;
//将temp值放到最终的位置
vec[pos] = tmp;
return;
}
static vector<int> heap_sort(vector<int> &vec) {
auto length = vec.size();
//1.构建大顶堆
for ( int i = length/2 -1; i >= 0; --i ) {
adjustHeap(vec,i,length);
}
//2.调整堆结构+交换堆顶元素与末尾元素
for ( int j = length - 1; j >= 1; j--){
swap(vec[j],vec[0]);
adjustHeap(vec,0,j);
}
return vec;
}
};