write this in a different way "Then we have Merge Sort, which is an advanced sorting algorithm with a time complexity of O$($n log n$)$ that uses a divide$-$and$-$conquer strategy to recursively split the list into smaller sub$-$lists and merge them in sorted order $($Knuth$,1998).$Finally$,$ according to Skiena $(2012),$ Quick Sort is a divide$-$and$-$conquer algorithm with an average time complexity of O$($n log n$)$ and it is known for its practical efficiency, though its worst$-$case time complexity can be O$($n$^2)$ under certain conditions."