Cod sursa(job #1631440)
Utilizator | Data | 5 martie 2016 16:06:12 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[500003];
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n, aux, i;
f>>n;
for (i=1; i<=n; i++)
f>>v[i];
int inv=1;
while (inv==1)
{
inv=0;
for (i=1; i<n; i++)
{
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
inv=1;
}
}
}
for(i=1; i<=n; i++)
g<<v[i]<<" ";
return 0;
}