Merge Sort

Question

The best case time complexity to merge two sorted file of size m and  n is

A. O(m)   B. O(n)   C. O(MIN{m,n}) D. O(m+n)

Comments

D) O(m+n) seems correct !

Answer 1

using Merge algo we can merge two sorted files in O(m+n);