Cod sursa(job #744101)
| Utilizator | Data | 7 mai 2012 15:24:46 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<vector>
#include<fstream>
using namespace std;
void ins_sort(vector<int>& a)
{
int sz=a.size();
for(int i=1;i<sz;++i)
{
int j=i;
int save=a[i];
while(j>0 && save<a[j-1])
{
a[j]=a[j-1];
--j;
}
a[j]=save;
}
}
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
int n;
vector<int> v;
in>>n;
int nr;
for(int i=0;i<n;++i)
{
in>>nr;
v.push_back(nr);
}
ins_sort(v);
for(int i=0;i<n;++i)
out<<v[i]<<" ";
out<<endl;
}
