堆排序的简单实现

#include<iostream>
#include<vector>
using namespace std;
void readNumbers(vector<int>&  numbers);
void printNumbers(const vector<int>&  numbers);
void exchange(int& number1, int& number2);
void heapify(vector<int>& numbers, int i);
void buildMaxHeap(vector<int>& numbers);
void heapSort(vector<int>& numbers);
int heapSize;
int main(){
vector<int> numbers;
readNumbers(numbers);
heapSize = numbers.size() - 1;
heapSort(numbers);
printNumbers(numbers);
system("pause");
return 0;
}

void readNumbers(vector<int>& numbers){                                       //对某个vector
cout << "please input a serials of number ends with a f:" << endl;
int number = 0;
numbers.push_back(0);                                                     //使得数组从下标1开始记录用户输入的数
while (cin >> number){
numbers.push_back(number);
}
}

void printNumbers(const vector<int>&  numbers){