Pagini recente » Cod sursa (job #1693412) | Cod sursa (job #2864512) | Cod sursa (job #2431471) | Statistici lupu flaviu (flaviulupu) | Cod sursa (job #1350350)
#include <iostream>
using namespace std;
int n, i, v[100];
void interclaseaza(int st, int mid, int dr){
int w[100];
int k = st-1;
int i = st;
int j = mid+1;
while(i <= mid && j <= dr){
if(v[i] < v[j]){
k++;
w[k] = v[i];
i++;
}else{
k++;
w[k] = v[j];
j++;
}
}
for(;i<=mid;i++){
w[++k] = v[i];
}
for(;j<=dr;j++){
w[++k] = v[j];
}
for(i=st;i<=dr;i++){
v[i] = w[i];
}
}
void sorteaza(int st, int dr){
if(st < dr){
int mid = (st+dr)/2;
sorteaza(st, mid);
sorteaza(mid+1, dr);
interclaseaza(st, mid, dr);
}
}
int main(){
cin>>n;
for(i=1;i<=n;i++){
cin>>v[i];
}
sorteaza(1, n);
for(i=1;i<=n;i++){
cout<<v[i]<<" ";
}
}