Pagini recente » Cod sursa (job #265906) | Cod sursa (job #1553146) | Cod sursa (job #1341763) | Cod sursa (job #3206521) | Cod sursa (job #1915559)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int N, v[500000], s;
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 a = 0; a < N-1; ++a){
if(v[a+1] < v[a]){
swap(v[a],v[a+1]);
s = 1;
}
}
}
while(s == 1);
for(int i = 0; i < N; ++i){
g << v[i] << " ";
}
f.close();
g.close();
return 0;
}