Cod sursa(job #1915588)
| Utilizator | Data | 8 martie 2017 21:44:37 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int N, v[5000], s, i;
ifstream f("algsort.in");
ofstream g("algsort.out");
f >> N;
for(int i = 0; i < N; ++i){
f >> v[i];
}
do{
s = 0;
for(int i = 0; i < N-1; ++i){
if(v[i+1] < v[i]){
swap(v[i],v[i+1]);
s = 1;
}
}
}
while(s == 1);
for(int i = 0; i < N; ++i){
g << v[i] << " ";
}
f.close();
g.close();
return 0;
}
