参考: 百度百科,堆排序
代码:
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
int a[maxn];
void min_heapify(int *a,int start,int End){
int father=start;
int son=2*father+1;
while(son<=End){
if(son+1<=End&&a[son]<a[son+1]) son++;
if(a[father]>a[son]) return;
else{
swap(a[father],a[son]);
father=son;
son=2*father+1;
}
}
}
void heap_sort(int *a,int n){
for(int i=n/2-1;i>=0;i--){
min_heapify(a,i,n-1);
}
for(int i=n-1;i>0;i--){
swap(a[0],a[i]);
min_heapify(a,0,i-1);
}
}
int main(){
int n;
printf("请输入元素个数:");
scanf("%d",&n);
printf("请输入%d个整数:\n",n);
for(int i=0;i<n;i++){
scanf("%d",a+i);
}
heap_sort(a,n);
//从小到大排序
printf("排序后的结果是:");
for(int i=0;i<n;i++){
printf("%d ",a[i]);
}
printf("\n");
return 0;
}