简单堆排序

简单堆排序

#include <iostream>
#include <cstdlib>
#include <ctime>
#define Father(N) ((N - 1) >> 1)
#define Left(N) ((N << 1) + 1)
#define Right(N) ((N + 1) << 1)
using namespace std;

#define VectorMax 10
int vector[VectorMax];
void heapSort(int *vector, const int length);
void print(int *vector, const int length);
int main()
{
    srand(time(NULL));
    for (int i = 0; i < VectorMax; i++)
        vector[i] = rand() % 1000;
    heapSort(vector, VectorMax);
    return 0;
}

void print(int *vec, int length) 
{
    for (int i = 0; i < length; i++)
        cout << vec[i] << " ";
    cout << endl;
}
void swap(int &a, int &b)
{
    int tmp = a;
    a = b;
    b = tmp;
} /*build Heap */ 
void buildHeap(int *vec, int length)
{
    for (int i = 1; i < length; i++) {
        int N = i;
        while (N > 0) {
            int father = Father(N);
            if (vec[father] > vec[N])
                swap(vec[father], vec[N]);
            N = father;
        }
    }
}                /*adjust Heap */

void adjustHeap(int *vec, const int length)
{
    int N = 0;
    int top = vec[0];
    while (N < length && Left(N) < length) {
        const int left = Left(N), right = Right(N);
        if (right >= length) {    /*if right exceed length */
            if (top > vec[left])
                vec[N] = vec[left], N = left;
            break;
        }
        if (vec[left] > top && vec[right] > top)    /*select the small one */
            break;
        int nextN = vec[left] < vec[right] ? left : right;
        vec[N] = vec[nextN];
        N = nextN;
    } vec[N] = top;
}
void heapSort(int *vec, const int length)
{
    buildHeap(vec, length);
    for (int i = length - 1; i > 0; i--) {    /*swap vec[0] and vec[heap_size-1] */
        swap(vec[0], vec[i]);    /*each for, the length of vec subtract 1 */
        adjustHeap(vec, i);
    } print(vec, length);
}