Pagini recente » Borderou de evaluare (job #2695431) | Cod sursa (job #256208) | Cod sursa (job #1703735) | Cod sursa (job #2899704) | Cod sursa (job #264489)
Cod sursa(job #264489)
#include <iostream.h>
#include<fstream.h>
fstream f("algsort.in",ios::in) ;
fstream g("algsort.out",ios::out);
int n,aux,max,i,ok;
long a[500001];
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>a[i];
do{ ok=1;
for(i=1;i<=n;i++){
if (a[i]>a[i+1]){ aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=0;
}}
} while(ok==0);
for(i=1;i<=n;i++) { g<<a[i]<<" "; }
g.close();
f.close();
return 0;
}