Cod sursa(job #1820776)
Utilizator | Data | 2 decembrie 2016 11:09:59 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int i,n,v[1000001];
bool ok;
int main()
{
f>>n;
for(i=1;i<=n;++i) f>>v[i];
do{
ok=0;
for(i=1;i<n;++i){
if(v[i]>v[i+1]){
swap(v[i],v[i+1]);
ok=1;
}
}
}while(ok);
for(i=1;i<=n;++i) g<<v[i]<<" ";
return 0;
}