interclasare divide et impera
Sortarea prin interclasare (merge-sort) Utilizand metoda divide et impera, sa se sorteze prin interclasare un sir #include<iostream.h>int a[20],n;void mergesort(int i,int m,int j){int b[20],x=i,k=1,y=m+1; while(x<=m && y<=j) if (a[x]<a[y]) …