[算法]堆排序

#include <stdio.h>

void swap(int *arr, int i, int j){
	int temp = arr[i];
	arr[i] = arr[j];
	arr[j] = temp;
}
void printArr(int arr[], int len){
	printf("==================================================================\n");
	for (int i = 0; i < len; i++)
	{
		printf("%4d", arr[i]);
		if (i != (len - 1))printf(",");
	}
	printf("\n==================================================================\n");
}


void HeapAdjust(int arr[], int p, int endIndex){
	int i, temp;
	temp = arr[p];
	for (i = 2 * p; i <= endIndex; i *= 2){
		if (i < endIndex && arr[i]<arr[i + 1])i++;
		if (temp>arr[i])break;
		arr[p] = arr[i];
		p = i;
	}
	arr[p] = temp;
}
void HeapSort(int arr[], int endIndex){
	int i;
	for (i = endIndex / 2; i > 0; i--)
		HeapAdjust(arr, i, endIndex);

	for (i = endIndex; i > 1; i--){
		swap(arr, 1, i);
		HeapAdjust(arr, 1, i - 1);
	}
}
int main(int argc, char **argv){
	int a[] = { -1, 50, 2, 6, 0, 30, 9, 1, 70, 4, 8, 49 };
	HeapSort(a, sizeof(a) / sizeof(a[0]) - 1); 

	printArr(a, sizeof(a) / sizeof(a[0]));

	return 0;
}