本文共 1086 字，大约阅读时间需要 3 分钟。
/* *//* 知识点： */#include #include #include #include #include #include using namespace std;#define MAXN 1005class heap_sort {private: public: void Swap(int &a,int &b) { int temp; temp=a; a=b; b=temp; } void max_heapify(int *A , int i, int len){ int l = 2 * i; int r = 2 * i + 1; int largest; if (l <= len && A[i] < A[l]){ largest = l; } else{ largest = i; } if (r <= len && A[largest] < A[r]) largest = r; if (largest != i){ Swap(A[largest], A[i]); max_heapify(A,largest,len); } } void build_heap(int *A ,int len){ for (int i = len/2; i >= 1; i--){ max_heapify(A, i, len); } } void heapsort(int *A,int len){ build_heap(A, len); for ( int i=len; i>=2; i--){ Swap(A[i], A[1]); len = len -1; max_heapify(A, 1, len); } }};int main(int argc, const char * argv[]) { int arr[15]; for(int i = 0; i <= 10; i++) cin >> arr[i]; heap_sort ans; ans.heapsort(arr, 10); for(int i = 1; i <= 10; i++) cout << arr[i] << " "; cout << endl; return 0;}
转载于:https://www.cnblogs.com/WH-K/p/7764461.html