第2章 算法入门
2.1 插入排序
/*2.1 插入排序
*INSERTION-SORT
*/
#include<cstdlib>
#include<iostream>
#include<vector>
#include<iomanip>
using namespace std;
int main()
{
vector<int> ivec;
int inData;
cout<<"input some integers with end-of-file!"<<endl;
while(cin>>inData){
ivec.push_back(inData);
}
vector<int>::iterator iteE, iteP;
int itemp;
for(iteE = ivec.begin() + 1; iteE != ivec.end(); ++iteE){
itemp = *iteE;
iteP = iteE;
while(iteP != ivec.begin() && *(iteP - 1) > itemp)
*iteP-- = *(iteP - 1);
*iteP = itemp;
}
for(iteE = ivec.begin(); iteE != ivec.end(); ++iteE)
cout<<setw(5)<<*iteE;
cout<<endl;
system("PAUSE");
return EXIT_SUCCESS;
}