Question: sorting algorithm has the lowest worst-case complexity?
Answer: From the following sorting algorithms which has the lowest worst case complexity? Let the input be n. The merge sort uses the weak complexity their complexity is shown as O(n log n).