堆排序算法简单复习及C++实现

最新推荐文章于 2024-12-04 17:22:39 发布

原创最新推荐文章于 2024-12-04 17:22:39 发布 · 264 阅读

0 ·

CC 4.0 BY-SA版权

【算法】专栏收录该内容

114 篇文章

订阅专栏

本文深入探讨了堆排序算法的原理，详细介绍了如何通过构建最大堆并进行堆调整来实现数组的排序过程。通过具体代码示例，展示了堆排序算法的实现细节，包括最大堆的构建、堆调整以及完整的排序流程。

1.代码

#include<stdio.h>
#include<stdlib.h>
#include<string.h>


#define left(x) (2 * x + 1)				
#define right(x) (2 * (x + 1))		


void MaxHeapify(int* a, int i, int low, int high)
{
	int l = left(i);
	int r = right(i);
	int largest;
	int temp;				

	if (l <= high && a[l] > a[i]){
		largest = l;
	} else {
		largest = i;
	}
	
	if (r <= high && a[r] > a[largest]){
		largest = r;
	}

	if (largest != i){
		temp = a[i];
		a[i] = a[largest];
		a[largest] = temp;
		MaxHeapify(a, largest, low, high);
	}
}


void BuildMaxHeap(int* a, int length)
{
	for (int i = length / 2 - 1; i >= 0; i--){
		MaxHeapify(a, i, 0, length - 1);
	}
}


void HeapSort(int a[], int length)
{
	int temp;
	BuildMaxHeap(a, length);
	for (int i = length - 1; i >= 1; i--){
		temp = a[i];
		a[i] = a[0];
		a[0] = temp;
		MaxHeapify(a, 0, 0, i - 1);
	}
}


int main(int argc, char *argv[])
{

	int array[10] = { 89, 4, 55, 1, 90, 100, 34, 22, 8, 21 };

	HeapSort(array, 10);

	for (int i = 0; i < 10; i++)
	{
		printf("%d ", array[i]);
	}

	system("pause");

	return 0;
}