Cod sursa(job #2983949)
Utilizator | Data | 23 februarie 2023 12:27:35 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
int main(){
int v[500005], n;
bool ok = true;
std::ifstream f1("algsort.in");
std::ofstream f2("algsort.out");
f1 >> n;
for(int i = 0; i < n; i++)
f1 >> v[i];
do{
ok = false;
for(int i = 0; i < n-1; i++)
if(v[i] > v[i+1])
{
ok = true;
std::swap(v[i], v[i+1]);
}
}while(ok);
for(int i = 0; i < n; i++)
f2 << v[i] << " ";
}