TLDR
Merge Sort is one of the most reliably consistent and well-performing sorting algorithms for sorting large datasets. It performs almost 40% fewer comparisons at it's worst than Quick Sort does on average. The Merge Sort algorithm takes a divide and conquer approach recursively. It breaks the array into smaller and smaller ones by calling itself, until each one only has one element inside of it. Then, it compares two numbers at a time, puts them into order and returns them to itself. Merge Sort performs all of the operations necessary to completely sort the list.via the TL;DR App
no story
