Cod sursa(job #797724)
Utilizator | skyper skyper96 | Data | 14 octombrie 2012 18:23:14 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int a[499999],i,aux;
long n;
bool ok;
f>>n;
for(i=0;i<n;i++)
f>>a[i];
do //bubble sort
{
ok=0;
for(i=0;i<n-1;i++)
if(a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=1;
}
}
while(ok==1);
for(i=0;i<n;i++)
g<<a[i]<<" ";
f.close();
g.close();
return 0;
}