堆排序

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
int a[MAXN] = {0,4,1,3,2,16,9,10,14,8,7};//10
int n = 10;//数的个数

void Max_Heap(int x,int n)
{
    //维护根节点为x的最大堆
    //n为数组长度
    int pos = x;
    int left_pos = x<<1;
    int right_pos = (x<<1) + 1;
    if (left_pos <= n && a[pos] < a[left_pos])
        pos = left_pos;
    if (right_pos <= n && a[pos] < a[right_pos])
        pos = right_pos;
    if (pos != x)
    {
        int tmp = a[pos];
        a[pos] = a[x];
        a[x] = tmp;
        Max_Heap(pos,n);
    }
    return ;
}

void Min_Heap(int x,int n)
{
    //维护根节点为x的最小堆
    //n为数组长度
    int pos = x;
    int left_pos = x<<1;
    int right_pos = (x<<1) + 1;
    if (left_pos <= n && a[pos] > a[left_pos])
        pos = left_pos;
    if (right_pos <= n && a[pos] > a[right_pos])
        pos = right_pos;
    if (pos != x)
    {
        int tmp = a[pos];
        a[pos] = a[x];
        a[x] = tmp;
        Min_Heap(pos,n);
    }
    return ;
}

void Build_Max_Heap(int x,int n)
{
    //给数组1-x位置建立最大堆，1为根节点
    //n为数组长度
    for (int i = x/2;i > 0;i--)
        Max_Heap(i,n);
}

void Build_Min_Heap(int x,int n)
{
    //给数组1-x位置建立最小堆，1为根节点
    //n为数组长度
    for (int i = x/2;i > 0;i--)
        Min_Heap(i,n);
}

void Print_Max_Heap(int x)
{
    //输出最大堆
    while (x)
    {
        cout << a[1] << ‘ ‘;
        int tmp = a[x];
        a[x] = a[1];
        a[1] = tmp;
        Max_Heap(1,x-1);//最后一个结点不使用，所以维护长度减1
        x--;
    }
}

void Print_Min_Heap(int x)
{
    //输出最小堆
    while (x)
    {
        cout << a[1] << ‘ ‘;
        int tmp = a[x];
        a[x] = a[1];
        a[1] = tmp;
        Min_Heap(1,x-1);
        x--;
    }
}

int main()
{
    Build_Max_Heap(n,n);
    Print_Max_Heap(n);
    Build_Min_Heap(n,n);
    Print_Min_Heap(n);


    return 0;
}
//运行结果
//16 14 10 9 8 7 4 3 2 1 
//1 2 3 4 7 8 9 10 14 16