Cod sursa(job #1517228)
Utilizator | Data | 3 noiembrie 2015 23:17:05 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int n,aux,i,j,a[500002],ok;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
ok=1;
while(ok==1)
{
ok=0;
for(i=1; i<=n-1; 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++)
g<<a[i]<<" ";
return 0;
}