Cod sursa(job #1315252)
Utilizator | Data | 12 ianuarie 2015 17:44:03 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include<iostream>
using namespace std;
int n, i, c, p, v[550];
void corect(int n){
for(i=2; i<=n; i++){
c=i;
p=i/2;
while(p!=0) // sau c!=1
if(v[c]>v[p]){
swap(v[c], v[p]);
c=p;
p/=2;
}else
break;
}
}
int main(){
cin>>n;
for(i=1; i<=n; i++)
cin>>v[i];
corect(n);
for(i=n; i>=2; i--){
swap(v[1], v[i]);
corect(i-1);
}
for(i=1; i<=n; i++)
cout<<v[i]<<" ";
return 0;
}