堆排序的实现求数组中第n大的元素

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>

//堆排序的实现求数组中第n大的元素

//向下调整法
static void adjustDown(int* data, int size, int n){	//n是要执行向下调整的节点
	int	cur = n;

	while (cur * 2 + 1 < size){
		if (cur * 2 + 2 >= size){
			n = cur * 2 + 1;
		}
		else {
			if (data[cur * 2 + 1] > data[cur * 2 + 2]){
				n = cur * 2 + 1;
			}
			else {
				n = cur * 2 + 2;
			}
		}
		if (data[cur] < data[n]){
			int tmp = data[cur];
			data[cur] = data[n];
			data[n] = tmp;
			cur = n;
		}
		else {
			break;
		}
	}
}

void swapHeap(int* data, int size){
	if (size == 0){
		return;
	}

	int tmp = data[0];
	data[0] = data[size - 1];
	data[size - 1] = tmp;
	adjustDown(data, size - 1, 0);
}

//堆排序求数组中第n大数字
void HeapSortS(int* src, int size, int n){
	int i;
	//将数据调整为堆
	for (i = size / 2 - 1; i >= 0; --i){
		adjustDown(src, size, i);
	}
	while (n - 1){
		swapHeap(src, size);
		--n;
		--size;
	}
}

int main(){
	//求数组中第n大的数字
	int data[10] = { 6, 2, 5, 4, 1, 9, 8, 10, 7, 3 };
	int n;
	printf("请输入一个整数n: ");
	scanf("%d", &n);
	HeapSortS(data, 10, n);
	printf("第%d大的数为%d\n", n, data[0]);
	system("pause");
	return 0;
}