Cod sursa(job #345632)
Utilizator | deaconu ioan crysys | Data | 3 septembrie 2009 20:58:12 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream.h>
int main()
{
unsigned long n,v[500000],i,j,gasit,aux;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
gasit=1;
while(gasit==1)
{
gasit=0;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
gasit=1;
}
}
for(i=1;i<=n;i++)
g<<v[i]<<" ";
return 0;
}