void adjust_element(vector<int>& data, int i) { if (2 * i + 1 >= data.size()) return ; int index = 2 * i + 1; int min = data[index]; if (2 * i + 2 < data.size() && data[2 * i + 2] < min) { min = data[2 * i + 2]; index = 2 * i + 2; } if (data[i] > min) { int x = data[i]; data[i] = min; data[index] = x; adjust_element(data, index); } } void heap_sort(vector<int>& data) { for (int i = data.size() / 2 - 1; i >= 0; --i) adjust_element(data, i); for (int i = data.size() - 1; i >= 0; --i) { cout << data[0] << ","; data[0] = data[i]; data.resize(data.size() - 1); adjust_element(data, 0); } }