#include<iostream>
#include<ctime>
//大根堆-》小根堆
using namespace std;
void show(int l[], int n) {
for (int i = 1; i <=n; i++) {
cout << l[i] << " ";
}
cout << endl;
}
//Heap Sort是树形选择排序,r[n]是一个完全二叉树的顺序存储结构,利用完全二叉树双亲与孩子的关系,选择关键字最大或最小记录
//堆定义:1、Ki>=k(2i) &&Ki>=k(2i+1)或2、ki<=k(2i) &&Ki<=k(2i+1)
//1、筛选法创建堆
//步骤:1.r[2s]和r[2s+1]中选择关键字最大的,假如r[2s+1]小,就比较r[s]和r[2s]的关键字
//2.判断,如果r[s]<r[2s],交换r[s]和r[2s],以r[2s+1]为根的子树是堆,而r[2s]为根的子树调整为堆,重复上述,直到叶子结点为止;
// 否则已经是堆,不用调整
void heapAdjust(int L[],int s,int m) {
//假设r[s+1,..m]是堆,把r[s,..m]调整为以r[s]为根的大根堆
int rc = L[s];
for (int j = 2 * s; j <= m; j *= 2) {//从N/2、N/2-1……开始,对其不是堆且较大的左右子树循环下去
if (j < m&&L[j] < L[j + 1] ) ++j;//比较.r[2s]和r[2s+1]
if (rc >= L[j]) {
break;
}//已经是堆,不用调整
L[s] = L[j];
s = j;//调整r[2s]或r[2s+1]的子树
}
L[s] = rc;
}
//2.建初始堆,总的比较次数小等于4n
//完全二叉树中序号大于n/2(向下取整)的结点都是种子,已是堆
//把前面的调整为堆,就可以了
void CreateHeap(int L[],int length) {
//大根堆的建成
for (int i = length / 2; i > 0; --i) {
heapAdjust(L,i ,length );
}
}
//算法实现
//通过反复进行交换和堆调整,(n-1)次筛选
void HeapSort(int L[], int length) {
CreateHeap(L, length);
int time = 1;
for (int i = length; i > 1; --i) {
int x = L[1]; L[1] = L[i]; L[i] = x;
heapAdjust(L, 1, i - 1);
printf("第%2d次调整\t", time++);
show(L, length);
}
}
//算法分析
/*
时间复杂度:最坏情况O(nlog2n)
空间复杂度o(1)
特点:不稳定;只能顺序结构;记录较少时不适合,当记录较多时,为高效
*/
int main() {
int *a = new int[17];
int length = 16;
srand(unsigned(time(NULL)));
for (int i = 1; i <= 16; i++) {
a[i]=rand()% 90 + 10;
}
cout << "==============" << endl;
cout << "堆排序:" << endl;
cout << "==============" << endl;
cout << "before sort:" << ends;
for (int i = 1; i <= 16; i++) {
cout<<a[i]<<" ";
}
cout << endl;
HeapSort(a, length);
cout << "after sort:" << ends;
for (int i = 1; i <= 16; i++) {
cout << a[i] << " ";
}
cout << endl;
delete a;
a = NULL;
}