堆刷选排序

#include <iostream>using namespace std;void createHeap(int a[]);void sortHeap(int a[],int n);int main(){int n ;cin>>n;int *a = new int[n+1];a[0] = 0;for(int i = 1;i<=n;i++)cin>>a[i];return 0;}void sortHeap(int a[],int n){ int low = n/2; int higth = n; int large = higth-1; int tmp =0; while(low>= 1) { tmp = a[low];if(low*2<n&& a[2*low] <a[2*low+1]) large = large+1; if(tmp<a[large]){ low = large; change(tmp,a[large]); } } }void change(int &i,int &j){int tmp = i;i = j;j = tmp;}