Function MergeSort

Sorting/MergeSort.js:44–70

(inputArr)

        
        },
        MergeSort = function(inputArr) {
            
            var len   = inputArr.length,
                left  = [],
                right = [],
                mid;
            
            // less than 2 elements means we can't merge / compare anything
            if (len < 2) {
                return inputArr;
            }
            
            // find the middle, rounding up for odd no of elems
            mid = Math.floor(len / 2);
            
            // split left and right into sub-arrays
            left  = inputArr.slice(0, mid);
            right = inputArr.slice(mid);
            
            // keep dividing the sub-arrays
            left  = MergeSort(left);
            right = MergeSort(right);
            
            // conquer the sub-arrays by sorting and merging them
            return Merge(left, right);
            
        };
    
    var myArray = [2, 4, 1, 6, 8, 5, 9, 3, 4];