Cod sursa(job #2429705)
Utilizator | cosmin blotucosmin | Data | 10 iunie 2019 21:16:55 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int v[500001], i, n, aux;
bool ok;
int main()
{
fin >> n;
for(i = 1; i <= n; ++ i)
fin >> v[i];
do
{
ok = true;
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 = false;
}
}while(!ok);
for(i = 1; i <= n; ++ i)
fout << v[i] << " ";
return 0;
}