Pagini recente » Cod sursa (job #196692) | Cod sursa (job #2746085) | Istoria paginii runda/eusebiu_oji_2005_cls11-12 | Cod sursa (job #473824) | Cod sursa (job #2140091)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main()
{
int a[500000],i,n,aux;
bool ok;
f>>n;
for(i = 1;i <= n;++i)
f>>a[i];
while(!ok)
{
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;
}
}
}
for(i = 1;i <= n;++i)
g<<a[i]<<' ';
return 0;
}