Cod sursa(job #332593)
Utilizator | Data | 18 iulie 2009 21:50:26 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream.h>
#include <fstream.h>
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,v[500000],i,j,aux;
f>>n;
for (i=0;i<n;i++)
f>>v[i];
f.close();
for (i=1;i<n;i++)
{
j=i;
while ( (j>0) && (v[j-1]>v[j]) )
{
aux=v[j];
v[j]=v[j-1];
v[j-1]=aux;
j--;
}
}
for (i=0;i<n;i++)
g<<v[i]<<" ";
g.close();
return 0;
}