Cod sursa(job #607591)
Utilizator | Data | 12 august 2011 18:28:54 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream.h>
#define MAX 500001
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[MAX];
int main()
{
int i,j,n,min,aux,k;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=2;i<=n;i++)
{
k=v[i];
j=i-1;
while(j>0&&v[j]>k)
v[j+1]=v[j], j--;
v[j+1]=k;
}
for(i=1;i<=n;i++)
g<<v[i]<<" ";
f.close();
g.close();
return 0;
}