Cod sursa(job #712567)
Utilizator | pop darius darius96 | Data | 13 martie 2012 16:30:35 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
fstream fin("algsort.in",ios::in),fout("algsort.out",ios::out);
void sortare(long long v[199999],long long n)
{
long long ok=1,i,aux;
do
{
ok=1;
for (i=1;i<n;i++)
{
if (v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=0;
}
}
}while (ok==0);
}
int main()
{
long long n,i,x[199999];
fin>>n;
for (i=1;i<=n;i++)
{
fin>>x[i];
}
sortare(x,n);
for (i=1;i<=n;i++)
{
fout<<x[i]<<" ";
}
return 0;
fin.close();
fout.close();
return 0;
}