Question: which algorithm has the lowest worst case complexity?
Answer: ANSWER: Merge sort The merge sort uses the weak complexity their complexity is shown as O(n log n).