Merge Sort

Merge sort is a divide and conquer algorithm that's ideal for implementation in Elixir due to its reliance on recursion. It works by recursively dividing the list into single-element lists and then merging these sorted lists to form a larger sorted list. Key functions include a recursive `sort/1` function that splits lists and a `merge/2` function that combines them by comparing and ordering elements.