const array = [1,3,6,8,2,6,6,2];
const merge = (...arr) => {
if(arr.length <= 2 && arr[0] > arr[1]) {
const lost = arr[0];
arr[0] = arr[1];
arr[1] = lost;
}
return arr;
const mid = Math.floor(arr.length / 2);
const lp = [];
const rp = [];
const ric = arr.length - mid;
for(let i = 0; i <= mid;i++) {
lp[lp.length] = arr[i];
}
for(let j = 0; j<ric;j++) {
rp[rp.length] = arr[mid + j];
}
return [...merge(lp) , ...merge(rp)];
};
alert(merge(array));