Merge Sort Algorithm

mergeSort.rb

def merge_sort(array1, array2)
  # write your code here
  sortedArray = []
  while array1.length>0 && array2.length>0
    p array1, array2
    if (array1[0] > array2[0])
      sortedArray.push(array2[0])
      array2.shift()
    else
      sortedArray.push(array1[0])
      array1.shift()
    end
  end

  while(array1.length>0)
    sortedArray.push(array1[0])
    array1.shift()
  end

  while(array2.length>0)
    sortedArray.push(array2[0])
    array2.shift()
  end

  return sortedArray
end

p merge_sort([1, 3, 9, 11], [2, 4, 6, 8])
# => [1, 2, 3, 4, 6, 8, 9, 11]