Cod sursa(job #1011390)
| Utilizator | Data | 16 octombrie 2013 20:05:25 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main(){int n,v[500000],aux;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(int i=0;i<n;i++) f>>v[i];
bool ok;
do{ok=1;
for(int i=0;i<n-1;i++)
if(v[i]>v[i+1]){aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=0;}
}while(!ok);
for(int i=0;i<n;i++)
g<<v[i]<<" ";
f.close();g.close();
return 0;}
