js 归并算法

最新推荐文章于 2022-04-18 15:24:11 发布

liuhongyi0104

最新推荐文章于 2022-04-18 15:24:11 发布

阅读量511

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/liuhongyi0104/article/details/79570145

算法专栏收录该内容

5 篇文章

订阅专栏

将数组递归分裂成单个元素然后合并数组

let data3 = [14, 54, 73, 38, 39, 67, 75, 80, 50, 40, 96, 27, 105, 109, 77, 31]
function breakArr (data,start,end){
      if (start < end) {

 let mid = Math.floor((start + end)/2)      
          breakArr(data,start,mid)
          breakArr(data,mid+1,end)
          combineArr(data,start,mid,end)
                }

 }
 function combineArr(data,start,mid,end){

     let i = start,j=mid+1;
     let m = mid,  n=end;

     let k = 0;
     let  temp = []
     while(i<=m && j<=n){
          if (data[i]<=data[j]) 
              temp[k++] = data[i++]

          else  
              temp[k++] = data[j++]
        }
    while(i<=m)
         temp[k++] = data[i++];

    while(j<=n)
         temp[k++] = data[j++];

    for ( i = 0; i < k; i++) {
        data[start + i] = temp[i]
    }

    console.log(temp)
 }


 breakArr(data3,0,15)