Cod sursa(job #280196)
Utilizator | Data | 13 martie 2009 11:39:17 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
long i,n,v[30],inj,aux,sw;
int main (){
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
inj=n;
while(inj>1){
inj=inj/2;
do{
sw=0;
for(i=1;i<=n-inj;i++)
if(v[i]>v[i+inj]){
aux=v[i];
v[i]=v[i+inj];
v[i+inj]=aux;
sw++;}}while(sw!=0);
}
for(i=1;i<=n;i++)
g<<v[i]<<' ';
return 0;}