Sorting with Merge Sort | Sorting Algorithms Visualised.

StatisticsMerge Sort description: Merge Sort starts by sorting every two elements. Then, the lists are sorted by comparing only the two smallest elements until all the elements are in ordered.Merge Sort example: You are organizing a messy library which only sorts books alphabetically. You organize each layer of each shelf individually, which helped you organize each book shelf. By dividing the library into smaller groups, every time you compare books you only had to compare two at a time.