Cod sursa(job #1146243)
Utilizator | Data | 18 martie 2014 20:26:05 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[500001],n,i,aux,ok;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
do
{
ok=1;
for(i=1;i<=n-1;i++)
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=0;
}
}
while(ok==0);
for(i=1;i<=n;i++)
g<<v[i]<<" ";
f.close();
g.close();
return 0;
}