Cod sursa(job #2983980)
| Utilizator | Data | 23 februarie 2023 13:01:17 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,x, a[500001], nr,i,j;
int main(){
f >> n;
for(i = 0; i < n; i++) f >> a[i];
while (j < n){
nr = 0;
for(i = 0; i < n-1; i++){
if(a[i] > a[i+1]){
swap(a[i], a[i+1]);
nr++;
}
}
if( nr == 0) break;
j++;
}
for(i = 0; i < n; i++) g << a[i] << " ";
return 0;
}
