Cod sursa(job #352787)
Utilizator | Data | 3 octombrie 2009 14:22:17 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream.h>
int main ()
{
long a[100],x,i,n,p=0;
fstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for (i=0; i<n; i++)
{ f>>a[i];
}
while (p==0)
{
p=1;
for (i=0; i<n-1; i++)
if (a[i]>a[i+1])
{ x=a[i];
a[i]=a[i+1];
a[i+1]=x;
p=0;
}
}
for (i=0; i<n; i++)
g<<a[i]<<" ";
return 0;
}