Cod sursa(job #3326903)
| Utilizator | Data | 1 decembrie 2025 10:49:18 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#define NMAX 500002
using namespace std;
ifstream fin ("algsort.in");
ofstream fout ("algsort.out");
int main()
{
int v[NMAX], n, aux, sch, i;
fin>>n;
for (i = 0; i < n; i++)
fin>>v[i];
do
{
sch=0;
for (i = 0; i < n - 1; i++)
if (v[i] > v[i + 1])
{
aux = v[i];
v[i] = v[i + 1];
v[i + 1] = aux;
sch = 1;
}
}
while(sch);
for (i = 0; i < n; i++)
fout<<v[i]<<' ';
return 0;
}
