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