本人菜鸟一只,正在学习C++。下面是自己编的代码, 能编译通过,但是觉得还能优化,暂时没有优化方案,望有大神指点一二~
#include<iostream>
#include<vector>
using namespace std;
void insert_sort(vector<int> &A) ;
int main()
{
vector<int> A, B;
vector<int>::iterator it;
int element;
while(cin >> element)
{
A.push_back(element);
}
insert_sort(A);
for(it = A.begin(); it != A.end(); it++)
{
cout << *it << " ";
}
cout << endl;
return 0;
}
void insert_sort(vector<int> &A)
{
for(int j = 1; j < A.size(); j++)
{
int key = A[j];
int i = j-1;
while(i >= 0 && A[i] > key)
{
A[i+1] = A[i];
i--;
}
A[i+1] = key;
}
// return A;
}
注:reference to《算法导论》