MergeSort

Quick Facts

• Splits list into sublists recursively and merges the sublists in order.
• Comparison sorting algorithm.
• Not an in-place sort. Must create temporary arrays.
• Runtime \(O(n*logn)\) in all three cases.
• Consumes \(O(n)\) space.

References

• https://www.geeksforgeeks.org/merge-sort/
• https://github.com/raywenderlich/swift-algorithm-club/tree/master/Merge%20Sort
• https://en.wikipedia.org/wiki/Merge_sort