Pagini recente » Cod sursa (job #2029367) | Cod sursa (job #2175714) | Cod sursa (job #2476196) | Cod sursa (job #431646) | Cod sursa (job #898048)
Cod sursa(job #898048)
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
int n,A[500010],i,ok,aux;
fin>>n;
for(i=1;i<=n;i++)
fin>>A[i];
ok=1;
while(ok==1)
{
ok=0;
for(i=1;i<n;i++)
if(A[i]>A[i+1]) {ok=1; aux=A[i];A[i]=A[i+1];A[i+1]=aux;}
}
for(i=1;i<=n;i++)if(i!=1) fout<<' '<<A[i]; else fout<<A[i];
fout<<'\n';
return 0;
}