Cod sursa(job #2781657)
| Utilizator | Data | 10 octombrie 2021 09:08:25 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.87 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
int vec[500001];
int swap = 0, finish = 0, n, aux, aux_2;
fin >> n;
for(int i = 0; i < n; i++)
{
fin >> vec[i];
}
while(finish != 1)
{
for(int i = 0; i < n - 1; i++)
{
for(int j = i + 1; j < n; j++)
{
if(vec[j] < vec[i])
{
swap = 1;
aux = vec[i];
aux_2 = vec[j];
vec[i] = aux_2;
vec[j] = aux;
}
else
{
finish = 1;
}
}
}
}
for(int i = 0; i < n; i++)
{
fout << vec[i] << " ";
}
}