What is the best time complexity to merge two sorted list of integers?
(A) O(n)
(B) O(n²)
(C) O(nlogn)
(D) O(n³)


Answer: (A)

Explanation: The best complexity of merging two sorted lists of integers is O(n) which is the same technique used in Merge Sort also known as two pointer technique.
So, option (A) is correct.

Quiz of this Question