🐸 Welcome to the world of algorithms! 🐸
Merge Sort is a divide-and-conquer algorithm that breaks down a list into several sub-lists until each sublist consists of a single element, then merges those sublists in a manner that results in a sorted list.