排序5. 堆排序
#include <bits/stdc++.h>
using namespace std;
void HeapAdjust(vector<int>& nums, int nums_beg, int nums_end)
{
int temp = nums[nums_beg];
for (int j = 2*nums_beg; j <= nums_end; j *= 2)
{
if (j < nums_end && nums[j] < nums[j + 1])
j++;
if (temp >= nums[j])
break;
swap(nums[nums_beg], nums[j]);
nums_beg = j;
}
}
void HeapSort(vector<int>& nums)
{
for (int i = (nums.size() - 1)/2; i >= 1; i--)
HeapAdjust(nums, i, nums.size() - 1);
for (int i = nums.size() - 1; i > 1; i--)
{
swap(nums[1], nums[i]);
HeapAdjust(nums, 1, i - 1);
}
}
int main()
{
vector<int> nums{ -1, 6, 5, 3, 3, 4, 9, 1, 10, 15, 16, 11, 33, 77, 21, 99, 111, 7};
HeapSort(nums);
for (auto &x : nums)
cout << x << ", ";
cout << endl;
return 0;
}