堆排序

/************************************************************************/
/*Heap Sort                                                             */
/************************************************************************/

#include <iostream>
#include <time.h>
#include "Timer.h"
using namespace std;

#define Swap(x, y) {int temp = x; x = y; y = temp;}

const int MAX = 100000;

void Input(int* numbers)
{
	srand((unsigned)time(NULL));

	for (int i = 0; i < MAX; i++)
	{
		numbers[i] = rand() % (MAX * 10);
	}
}

void Output(int* numbers)
{
	for (int i = 1; i <= MAX; i++)		
	{
		cout << numbers[i-1] << " ";

		if (0 == i % 10)
		{
			cout << endl;
		}
	}

	cout << endl;
}

void HeapAdjust(int* numbers, int s, int len)
{
	int temp = numbers[s];

	for (int j = 2*s; j <= len; j *= 2)
	{
		if (j < len && numbers[j] < numbers[j+1])
		{
			j++;
		}

		if (temp >= numbers[j])
		{
			break;
		}

		numbers[s] = numbers[j];
		s = j;
	}

	numbers[s] = temp;
}

void HeapSort(int* numbers, int len)
{
	for (int i = len/2; i >= 0; i--)
	{
		HeapAdjust(numbers, i, len);
	}

	for (int i = len-1; i > 0; i--)
	{
		//弹出最大值，重新对i-1个元素建堆
		Swap(numbers[0], numbers[i]);
		HeapAdjust(numbers, 0, i-1);
	}
}


void main()
{
	//int num[MAX];
	int* num = new int[MAX];
	Input(num);

	cout << "Bubble before: " << endl;
	//Output(num);
	
	
	Timer timer;
	HeapSort(num, MAX);
	cout <<"\nTime Elapsed: " << timer.GetElapsedTime() << "s" << endl;


	cout << "\nBubble after: " << endl;
	//Output(num);

	delete[] num;
}

测试数据：10万个int数据。

运行结果如下：