Cod sursa(job #3342151)
| Utilizator | Data | 23 februarie 2026 10:44:23 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
int v[500010];
int n, i, j, aux, sortat;
int main () {
ifstream fin ("algsort.in");
ofstream fout("algsort.out");
fin>>n;
for (i=1;i<=n;i++)
fin>>v[i];
do {
sortat = 1;
for (i=1;i<n;i++)
if (v[i] > v[i+1]) {
aux = v[i];
v[i] = v[i+1];
v[i+1] = aux;
sortat = 0;
}
} while (sortat == 0);
for (i=1;i<=n;i++)
fout<<v[i]<<" ";
return 0;
}
