Question

For merging two sorted lists of sizes m and n into a sorted list of size m+n, we required comparisons of

• A. O(m+n)
• B. O(m)
• C. O(n)
• D. O(logm + logn)

Answer 1

The correct option is A O(m+n)

The number of comparisons required in the worst case is 0(m + n).