C++堆排序源码演示

下面代码是关于C++堆排序演示的代码。

#include
#include
#include
#include

using namespace std;
typedef vector::iterator ivecIte;
#define parent(i) (0==(i%2) ? i/2 : (i-1)/2)

size_t chkivIte(ivecIte iteB, ivecIte iteE)
{
if(iteB > iteE) {
cout<<“wrong in iterator range!”<<endl;
exit(0);
}
return iteE - iteB;
}
void maxHeapify(vector &ivec, ivecIte iteB, ivecIte iteE, ivecIte iteChk)
{
size_t heapSize = chkivIte(iteB, iteE);
size_t i = iteChk - iteB + 1;

if(left(i)<=heapSize) {
	ivecIte leftIte = iteB+left(i)-1;
}
if(right(i)<=heapSize) {
	ivecIte rightIte = iteB+right(i)-1;
}
if(iteChk != largeIte) {
	maxHeapify(ivec, iteB, iteE, largeIte);
}

}
void buildMaxHeap(vector &ivec, ivecIte iteB, ivecIte iteE)
{
size_t heapSize = chkivIte(iteB, iteE);
size_t indx = heapSize/2;
ivecIte iteChk;
for(size_t t = indx; 0 != t; --t) {
iteChk = iteB + t - 1;
maxHeapify(ivec, iteB, iteE, iteChk);
}
}
void heapSort(vector &ivec, ivecIte iteB, ivecIte iteE)
{
size_t heapSize = chkivIte(iteB, iteE);
buildMaxHeap(ivec, iteB, iteE);
ivecIte iteT;
for(size_t t = heapSize; 1 != t; --t) {
iteT =iteB + t - 1;
maxHeapify(ivec, iteB, iteT, iteB);
}
}
int main()
{
vector ivec;
cout<<“input some integers with end-of-file!”<<endl;
int inData;
while(cin>>inData)
ivec.push_back(inData);
heapSort(ivec, ivec.begin(), ivec.end());
for(ivecIte ite = ivec.begin(); ivec.end() != ite; ++ite)
cout<<endl;
system(“PAUSE”);
return EXIT_SUCCESS;
}