堆排序
直接上代码说话:
void Swap(int* num1, int* num2)
{
int temp = *num1;
*num1 = *num2;
*num2 = temp;
}
void AdjustDown(int* arr, int n, int parent) //向下排序法
{
int child = 2 * parent + 1;
while (child < n)
{
if (child + 1 < n && arr[child] < arr[child + 1])
child++;
if (arr[child] >arr[parent])
{
Swap(&arr[child], &arr[parent]);
parent = child;
child = 2 * parent + 1;
}
else
{
break;
}
}
}
void HeapSort(int* arr, int n) //升序 建大堆 堆排序
{
for (int i = (n - 2) / 2; i >= 0; i--) //建大堆
{
AdjustDown(arr, n, i);
}
int end = n - 1;
while (end > 0)
{
Swap(&arr[0], &arr[end]);
AdjustDown(arr, end, 0);
end--;
}
}
void PrintArray(int*arr, int n) // 打印数组
{
for (int i = 0; i < n; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
int main()
{
int arr[] = { 1, 3, 4, 9, 3, 5, 7, 0 ,8, 6, 2};
printf("原来的数组arr\n");
PrintArray(arr, sizeof(arr) / sizeof(int));
printf("堆排序之后的数组arr\n");
HeapSort(arr,sizeof(arr)/sizeof(int));
PrintArray(arr, sizeof(arr) / sizeof(int));
system("pause");
}
结果: