Cod sursa(job #1001633)
Utilizator | Data | 25 septembrie 2013 18:30:41 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
int i, auxok, aux, ok, n, v[500002];
FILE*fin=fopen("algsort.in","r");
ofstream fout("algsort.out");
int main(){
fscanf(fin,"%d", &n);
for(i=1; i<=n; i++)
fscanf(fin,"%d", &v[i]);
ok = 1;
do {
ok=0;
for(i=2; i<=n; i++){
if(v[i]<v[i-1]){
aux=v[i];
v[i]=v[i-1];
v[i-1]=aux;
ok=1;
}
}
} while(ok==1);
for(i=1; i<=n; i++)
fout<<v[i]<<" ";
fout<<"\n";
return 0;
}