Sorting Suite with JS

JS bubble and merge sort

function bubbleSort(list) {
  var length = list.length;
    for (var i = 0; i < length; i++) {
      for (var j = 0; j < (length - i - 1); j++) {
        if(list[j] > list[j+1]) {
          var temp = list[j];
          list[j] = list[j+1];
          list[j+1] = temp;
        }
      }
    }
};



var list = [4, 11, 92, 6]
bubbleSort(list)
console.log(list)



function mergeSort(arr) {
  if (arr.length === 1) {
    return arr
  }

  var middle = Math.floor(arr.length / 2)
  var left = arr.slice(0, middle)
  var right = arr.slice(middle)

  return merge( mergeSort(left), mergeSort(right) )
}


function merge(left, right) {
  let result = []
  let indexLeft = 0
  let indexRight = 0

  while (indexLeft < left.length && indexRight < right.length) {
    if (left[indexLeft] < right[indexRight]) {
      result.push(left[indexLeft])
      indexLeft++
    } else {
      result.push(right[indexRight])
      indexRight++
    }
  }

  return result.concat(left.slice(indexLeft)).concat(right.slice(indexRight))
}



var list = [4, 11, 92, 6, 3, 75, 30, 111]
mergeSort(list)
// console.log(mergeSort(list))

module.exports = mergeSort