Cod sursa(job #287104)
| Utilizator | Data | 24 martie 2009 16:05:49 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream f2("algsort.out");
long a[500001];
int n;
f>>n;
for(int i=0;i<n;i++) f>>a[i];
bool ok = 1;
while(ok)
{
ok = 0;
for(int i=0;i<n-1;i++)
if(a[i]>a[i+1])
{
ok = 1;
long aux = a[i];
a[i] = a[i+1];
a[i+1] = aux;
}
}
for(int i=0;i<n;i++) f2<<a[i]<<" ";
f.close();
f2.close();
return 0;
}
