Cod sursa(job #631992)
| Utilizator | Data | 9 noiembrie 2011 23:45:52 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int main()
{int n, a[500001], cheie, i,j;
in>>n;
for(i=1;i<=n;i++)
in>>a[i];
//urmeaza sa sortam prin metoda insertiei
for(j=2;j<=n;j++)
{ cheie=a[j];
i=j-1;
while(i>0 && a[i]>cheie)
{a[i+1]=a[i];
i=i-1;
}
a[i+1]=cheie;
}
for(i=1;i<=n;i++)
out<<a[i]<<" ";
}
