## Merge Sort in JavaScript

Merge sort [https://en.wikipedia.org/wiki/Merge_sort] is a great general purpose sorting algorithm. In fact some browsers have even used it for Array. »

Merge sort [https://en.wikipedia.org/wiki/Merge_sort] is a great general purpose sorting algorithm. In fact some browsers have even used it for Array. »

Quick sort [https://en.wikipedia.org/wiki/Quicksort] is one of the more performant sorting algorithms, having an average complexity of O(n log n), though »

Insertion sort [https://en.wikipedia.org/wiki/Insertion_sort] is another simple sorting algorithm, often taught initially with bubble sort and selection sort. I found this »

Selection sort [https://en.wikipedia.org/wiki/Selection_sort] is a basic sorting algorithm. It's an in-place comparison sort. It's generally considered to be not performant »

Bubble sort [https://en.wikipedia.org/wiki/Bubble_sort] is one of the basic sorting algorithms. It gets its name because it bubbles up the values. »