@sivarajans/merge-sort
Version:
Merge sort impelementation
1 lines • 490 B
JavaScript
;Object.defineProperty(exports,"__esModule",{value:!0}),exports["default"]=MergeSort;function MergeSort(a,lb,ub){if(lb<ub){var mid=Math.floor((lb+ub)/2);MergeSort(a,lb,mid),MergeSort(a,mid+1,ub),divideAndConquer(a,lb,mid,ub)}}function divideAndConquer(a,lb,mid,ub){for(var i=lb,j=mid+1,k=lb,sorted=[];i<=mid&&j<=ub;)a[i]>=a[j]?(sorted[k]=a[j],j++):(sorted[k]=a[i],i++),k++;for(;i<=mid;)sorted[k]=a[i],i++,k++;for(;j<=ub;)sorted[k]=a[j],j++,k++;for(k=lb;k<=ub;k++)a[k]=sorted[k]}