Merge sort is one of the O$($n log n$)$ sorts we consider. it relies on the idea of recursively splitting a list into smaller sub$-$lists and sorting them, then recombining the sorted lists.