Pagini recente » Istoria paginii dot-com/2009/solutii/runda-2 | Cod sursa (job #2023914) | Atasamentele paginii preONI 2005 (Runda 2) | Monitorul de evaluare | Cod sursa (job #266579)
Cod sursa(job #266579)
#include<fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,j,aux,a[100],sw;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>a[i];
do{ sw=0;
for(i=1;i<n;i++)
if (a[i]>a[i+1]){ aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
sw++;
}
} while(sw!=0);
for(i=1;i<=n;i++)
g<<a[i]<<' ';
f.close();
g.close();
return 0;}