Function Merge

Sorting/MergeSort.js:3–43

(left, right)

(function() {
    
    var Merge = function(left, right) {
        
            var l = 0,
                r = 0, 
                k = 0,
                l_len  = left.length,
                r_len  = right.length,
                result = [];
            
            // go through both arrays, comparing each element against the element in the adjacent array
            while (l < l_len && r < r_len) {
            
                if (left[l] < right[r]) {
                    result[k] = left[l];
                    l++;
                }
                else {
                    result[k] = right[r];
                    r++;
                }
                
                // move the pointer of the result array forward
                k++;
                
            }
            
            // if one of the arrays is larger than the other, we may have some leftovers
            while (l < l_len) {
                result[k] = left[l];
                l++;
                k++;
            }
            while (r < r_len) {
                result[k] = right[r];
                r++;
                k++;
            }
            
            return result;
        
        },
        MergeSort = function(inputArr) {
            
            var len   = inputArr.length,