Added Merge Sort and Quick Sort in JavaScript

Merge Sort: This implementation deliberately avoids using JavaScript array functions such as shift(). All array functions in JavaScripts are maps, so using it may add an additional O(n) complexity.

Quick Sort: Implementation uses a random pivot from 0 to n where n is the amount of numbers.