Merge Sort

The merge sort algorithm is a divide and conquer algorithm. With that in mind, this algorithm works by dividing the original set in half to make two sets, then dividing the resulting two sets in half again, if possible, and continuing to do this until all numbers from the original set have been divided down into their own set. Next the values within the individual sets are compared and combined back together into sorted sets.