代碼如下,僅供參考:
void heapSort(vector<int>& nums) {
heapify(nums);
int n = nums.size();
for(int i = n - 1; i >= 0; i--) {
swap(nums[0], nums[i]);
shiftDown(nums, i, 0);
}
}
void shiftUp(int k){
while( k > 1 && data[k/2] < data[k] ){
swap( data[k/2], data[k] );
k /= 2;
}
}
void shiftDown(vector<int>& nums, int n, int k) {
while(2 * k + 1 < n) {
int j = 2 * k + 1;
if(j + 1 < n && nums[j] < nums[j+1])
j = j + 1;
if(nums[j] > nums[k])
swap(nums[j], nums[k]);
k = j;
}
}
void heapify(vector<int> &nums) {
int n = nums.size();
for(int i = (n - 1) / 2; i >= 0; i--) {
shiftDown(nums, n, i);
}
}