Cod sursa(job #2140097)
| Utilizator | Data | 23 februarie 2018 00:13:23 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main()
{
int a[500000],i,n,aux,nouN,k;
f>>n;
for(i = 1;i <= n;++i)
f>>a[i];
k = n;
while(n)
{
nouN = 0;
for(i = 1;i < n;++i)
{
if(a[i] > a[i + 1])
{
aux = a[i];
a[i] = a[i + 1];
a[i + 1] = aux;
nouN = i;
}
}
n = nouN;
}
for(i = 1;i <= k;++i)
g<<a[i]<<' ';
return 0;
}
