Cod sursa(job #2987465)
Utilizator | Data | 2 martie 2023 13:04:45 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main() {
ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
f>>n;
int a[n];
for(int i=0; i<n; i++){
f>>a[i];
}
f.close();
int nr = 2;
while(nr!=0){
nr = 0;
for(int i=0; i<n-1; i++){
if(a[i]>a[i+1]){
nr = 1;
int aux = a[i];
a[i] = a[i+1];
a[i+1] = aux;
}
}
}
for(int i=0; i<n; i++){
g<<a[i]<<" ";
}
return 0;
}