算法导论排序算法之堆排序（五）

#include <iostream>using namespace std;void max_heap(int *arr, int i, int n){int l = i*2;int r = i*2+1;int largest;if ( l <= n && arr[l] > arr[i]){largest = l;}elselargest = i;if (r <= n && arr[r] > arr[largest]){largest = r;}if (largest != i){int tmp;tmp = arr[i];arr[i] = arr[largest];arr[largest] = tmp;max_heap(arr, largest, n);}}void build_max_heap(int *arr, int n){int len = n/2;for (int i = len; i >= 0; i--){max_heap(arr, i, n);}}void heap_sort(int *arr, int n){int tmp;build_max_heap(arr, n);for (int i = n; i > 0; i--){tmp = arr[n];arr[n] = arr[0];arr[0] = tmp;n--;build_max_heap(arr, n);max_heap(arr, 0, n);}}void print(int* arr, int n){for (int i = 0; i < n; i++){cout << arr[i];}return;}int main(void){int arr[10] = {2,4,3,1,6,8,9,7,5,0};heap_sort(arr, 9);print(arr, 10);return 0;}