Cod sursa(job #858824)
| Utilizator | Data | 19 ianuarie 2013 13:55:47 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,a[500100];
bool ok=true;
void schimb(int &x, int &y)
{int aux=x;
x=y;
y=aux;
}
int main()
{int i,k;
f>>n;
for (i=1;i<=n;++i)
f>>a[i];
for (k=0;ok;++k)
{ok=false;
for (i=1;i<n-k;++i)
if (a[i]>a[i+1])
{schimb(a[i],a[i+1]);
ok=true;
}
}
for (i=1;i<=n;++i)
g<<a[i]<<' ';
g<<'\n';
return 0;
}
