#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <algorithm> using namespace std;
void swap(int &num1,int &num2){if(num1 != num2){num1 ^= num2;num2 ^= num1;num1 ^= num2;}
}
void insert(vector<int> &arr_sort){//构建一个最大堆 for(int i = 1;i < arr_sort.size();i ++){int j = i;while(arr_sort[j] > arr_sort[(j - 1)/ 2]){swap(arr_sort[j],arr_sort[(j - 1)/2]);j = (j - 1)/2; }}
} void pop(vector<int> &arr_sort){for(int i = 0;i < arr_sort.size();i ++){int tmp = arr_sort[0],j = 0;while(j * 2 + 2 <= arr_sort.size() - i - 1){if(arr_sort[j * 2 + 1] > arr_sort[j * 2 + 2]){arr_sort[j] = arr_sort[j * 2 + 1];j = j * 2 + 1;}else{arr_sort[j] = arr_sort[j * 2 + 2];j = j * 2 + 2;}}arr_sort[j] = arr_sort[arr_sort.size() - i - 1];while(arr_sort[j] > arr_sort[(j - 1)/ 2]){swap(arr_sort[j],arr_sort[(j - 1)/2]);j = (j - 1)/2; }arr_sort[arr_sort.size() - i - 1] = tmp;}
}void initVec(vector<int> &vec) {srand((unsigned)time(NULL)); int len = rand() % 1000;for(int i = 0; i < len; i ++) {vec.push_back(rand() % 1000);}
}void heap_sort(vector<int> &vec) {insert(vec);pop(vec);
}void print(vector<int> vec) {for(int i = 0;i < vec.size();i ++) {cout << vec[i] << " ";}cout << endl;
}int main(){int nums = 10;while(nums --) {vector <int> arr1;vector <int> arr2;initVec(arr1);arr2 = arr1;heap_sort(arr1);sort(arr2.begin(), arr2.end());cout << "the heap_sort result: ";print(arr1);cout << "the correct result: ";print(arr2);for(int i = 0; i < arr1.size(); i ++) {if(arr1[i] != arr2[i]) {cout << "wrong result:" << endl;cout << arr1[i] << " and " << arr2[i] << endl;return 1;}}cout << "correct result!" << endl;}return 0;
}