#include <vector>
#include <iostream>
#include <stdio.h>
#define left(i) (2*i+1)
#define right(i) (2*(i+1))
using namespace std;
void swap(int &a, int &b)
{
int c = a;
a = b;
b = c;
}
void Heapify(int array[], int len, int pos)
{
if (pos >= len)
return;
if (right(pos) < len&&array[right(pos)] > array[pos])
{
if (array[right(pos)] >= array[left(pos)])
{
swap(array[right(pos)], array[pos]);
Heapify(array, len, right(pos));
}
else
{
swap(array[left(pos)], array[pos]);
Heapify(array, len, left(pos));
}
}
else if (left(pos) < len&&array[left(pos)] > array[pos])
{
swap(array[left(pos)], array[pos]);
Heapify(array, len, left(pos));
}
}
void BuildHeap(int array[], int len)
{
for (int i = len / 2; i >= 0; i--)
{
Heapify(array, len, i);
}
}
void HeapSort(int array[], int len)
{
BuildHeap(array, len);
for (int i = len-1; i >=0; i--)
{
swap(array[0], array[i]);
Heapify(array, i, 0);
}
}
int main()
{
int array[10] = { 3, 6, 4, 2, 9, 12, 13, 1, -2, 7 };
HeapSort(array, 10);
return 0;
}
堆排序C++
最新推荐文章于 2024-09-14 22:25:23 发布