排序第三篇--堆排序

这个东西就一直没有记住过，看完就忘，话说谁没事写堆排啊（自己发牢骚），这里为了学习还是标记一下这个知识，堆排之前需要建堆，所以代码还是不少的，废话少说，直接上代码吧，虽然长但很好理解。

#include"stdafx.h"
#include<iostream>
#include<time.h>
using namespace std;
typedef struct node
{
    int *data;
    int size;
    int capacity;
}node;


#define MAXSIZE 100000
node *creat(int maxsize,int x)
{
    node *h = new node;
    h->data = new int[sizeof(int)*(maxsize + 1)];
    h->size = 0;
    h->capacity = maxsize;
    h->data[0] = MAXSIZE;
    for (int i = 1; i <= x; i++)
    {
        cin >> h->data[i];
        h->size++;
    }
    return h;
}


void buildheep(node *h,int Size)
{
    int i;
    for (i = Size / 2; i > 0; i--)
    {
        int parent,child;
        int x = h->data[i];
        for (parent = i; parent * 2 <=Size; parent = child)
        {
            child = parent * 2;
            if (child != Size&&h->data[child] < h->data[child + 1])
                child++;
            if (x >= h->data[child])break;
            else h->data[parent] = h->data[child];
        }
        h->data[parent] = x;
    }
}


void heepsort(node *h)
{
    buildheep(h,h->size);
    int temp;
    for (int i = h->size; i > 0; i--)
    {
        temp = h->data[1];
        h->data[1] = h->data[i];
        h->data[i] = temp;
        buildheep(h, i-1);
    }
}


/*bool IsFull(node *h)
{
    return(h->size == h->capacity);
}
bool insrt(node *h, int x)
{
    int i;
    if (IsFull(h))
    {
        cout << "已满";
        return false;
    }
    else
    {
        i = h->size++;
        for (; h->data[i / 2] < x; i /= 2)
            h->data[i] = h->data[i / 2];
        h->data[i] = x;
        return true;
    }
}*/


/*bool IsEmpty(node *h)
{
    return h->size == 0;
}
int Delete(node *h)
{
    int parent, child, x, max;
    if (IsEmpty(h))
    {
        cout << "已空";
        return -1;
    }
    max = h->data[1];
    x = h->data[h->size--];
    for (parent = 1; parent * 2 <= h->size; parent = child)
    {
        child = parent * 2;
        if (child != h->size&&h->data[child] < h->data[child + 1])
            child++;
        if (h->data[child] <= x)break;
        else h->data[parent] = h->data[child];
    }
    h->data[parent] = x;
}*/


void print(node *h)
{
    for (int i = 1; i <= h->size; i++)
        cout << h->data[i] << " ";
}


int main()
{
    int maxsize,x; cin >> maxsize>>x;
    node *h = creat(maxsize,x); 
    heepsort(h);
    print(h); 
    return 0;
}

ps:从之前的代码文件里翻出来的上古代码，不敢相信这是之前的自己写的

————————————2018.4.21更新—————————————
这次写了个新的用的数组并没有结构体指针的内容,分析就不在赘述了，注解已经很清楚了。
代码：

#include<iostream>
#include<time.h>
using namespace std;
const int MAX = 100;
int left(int i) {
    return i * 2;
}
int right(int i) {
    return i * 2 + 1;
}
void heap_creat(int *a,int len,int i) {
    int l = left(i);
    int r = right(i);
    int _max;
    if (l <= len&&a[l] > a[i]) {//判定左右子节点与父节点的大小，取最大值
        _max = l;
    }
    else _max = i;
    if (r <= len&&a[r] > a[_max]) {
        _max = r;
    }
    if (_max != i) {
        int temp = a[i];
        a[i] = a[_max];
        a[_max] = temp;
        heap_creat(a, len, _max);//保持这个最大子树的基础上继续往下推
    }

}
void build(int *a, int len) {
    for (int i = len/2; i >=1; i--) {//最后一个根是数组len/2这个位置
        heap_creat(a, len, i);
    }
}

void heap_sort(int *a, int len) {
    int le = len;
    build(a, len);
    for (int i = len; i >= 2; i--) {//将大头堆的顶节点与最后一位交换，然后在维护最大堆
        int temp = a[i];
        a[i] = a[1];
        a[1] = temp;
        le--;
        heap_creat(a, le, 1);//这里是从1开始维护，因为变得只是丁节点，冲顶往下维护就好
    }

}
int main(void) {

    int n; cin >> n;;
    int *a = new int[100];
    a[0] = 0;
    srand((unsigned)time(NULL));
    for (int i = 1; i <= n; i++) {
        a[i] = rand()%100;//取1~100
        cout << a[i] << " ";
    }
    cout << endl;
    heap_sort(a, n);
    for (int i = 1; i <= n; i++)
        cout << a[i] << " ";
    system("PAUSE");
    return 0;
}