#include<iostream>
using namespace std;
const int maxn = 110;
int a[maxn] = {};
int n;
void downadjust(int low, int high) {
int i = low;
int j = i * 2;
while (j <= high) {
if (j + 1 <= high && a[j + 1] > a[j])
j = j + 1;
if (a[j] > a[i]) {
swap(a[i], a[j]);
i = j;
j = i * 2;
}
else break;
}
}
void creatheap() {
for (int i = n / 2; i >= 1; i--)
downadjust(i, n);
}
void heapsort() {
creatheap();
cout << a[1]<<" ";
for (int i = n; i >1; i--) { //不是>=1
swap(a[1], a[i]);
downadjust(1, i-1); //
cout << a[1]<<" ";
}
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) //堆是完全二叉树,必须从1开始存
cin >> a[i];
heapsort();
system("pause");
return 0;
}
【2012】堆排序模板
于 2022-03-12 11:10:30 首次发布