zoukankan      html  css  js  c++  java
  • [Algorithms] Divide and Recurse Over an Array with Merge Sort in JavaScript

    Merge sort is a recursive sorting algorithm. If you don't understand recursion, I recommend finding a resource to learn it. In brief, recursion is the act of a function calling itself. Thus, merge sort is accomplished by the algorithm calling itself to provide a solution.

    Merge sort divides the given array into two halves, a left half and a right half. We call merge sort on these sub-arrays. We continue to split our sub-arrays until we get arrays whose length is less than two. We then begin to stitch our small arrays back together, sorting them on the way up.

    This is an efficient algorithm because we start by sorting very small arrays. By the time we reach our larger ones, they are already mostly sorted, saving us the need for expensive loops. To create our algorithm, we'll actually need two functions, our mergeSort function and a merge function that does the combining and sorting of our sub-arrays.

    Utilize Javascript LIFO (last in first our queue stack to do the traverse)

    For example:

    [10, 5, 6, 3, 2, 8, 9, 4, 7, 1]
    left [ 10 ] right [ 5 ] reuslts [ 5, 10 ]
    left [ 3 ] right [ 2 ] reuslts [ 2, 3 ]
    left [ 6 ] right [ 2, 3 ] reuslts [ 2, 3, 6 ]
    left [ 5, 10 ] right [ 2, 3, 6 ] reuslts [ 2, 3, 5, 6, 10 ]
     
    left [ 8 ] right [ 9 ]reuslts [ 8, 9 ]
    left [ 7 ] right [ 1 ] reuslts [ 1, 7 ]
    left [ 4 ] right [ 1, 7 ] reuslts [ 1, 4, 7 ]
    left [ 8, 9 ] right [ 1, 4, 7 ] reuslts [ 1, 4, 7, 8, 9 ]

    left [ 2, 3, 5, 6, 10 ] right [ 1, 4, 7, 8, 9 ] reuslts [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ]

    function mergeSort (array) {
        // if array is length less than two items, no need to sort
        if ( array.length < 2 ) {
            return array;
        }
    
        // find the middle point of the array to split it into two
        const middle = Math.floor(array.length / 2);
        const left = array.slice(0, middle);
        const right = array.slice(middle);
    
        return merge(
            mergeSort(left),
            mergeSort(right)
        )
    }
    
    function merge(left, right) {
        let sorted = [];
        console.log('left', left)
        console.log('right', right)
        while (left.length && right.length) {
            if (left[0] < right[0]) {
                sorted.push(left.shift())
            } else {
                sorted.push(right.shift())
            }
        }
    
    
        const reuslts = [...sorted, ...left, ...right];
    
        console.log('reuslts', reuslts)
        return reuslts;
    }
    
    let numbers = [10, 5, 6, 3, 2, 8, 9, 4, 7, 1]
    
    mergeSort(numbers)
    
    exports.mergeSort = mergeSort

         

  • 相关阅读:
    Xcode4快速Doxygen文档注释 — 简明图文教程
    iOS6 旋转
    echart 判断数据是否为空
    echart tootip使用技巧
    下拉菜单自动向上或向下弹起
    前后台数据交互
    打包代码
    echart 设计宽度为百分比时,div撑不开
    无缝滚动(小鹏写)
    内置对象-Request对象
  • 原文地址:https://www.cnblogs.com/Answer1215/p/10159749.html
Copyright © 2011-2022 走看看