📢 Starts today 👉 Join CAT 2 months crash course
Given twosorted list of size m and n respectively. The number of comparisons needed the worst case by the mergesort algorithm will be
$$m \times n$$
maximum of m and n
minimum of m and n
m + n - 1
Create a FREE account and get:
Ask doubts feature is currently unavailable for you. You can reach us at email@example.com for any further details/doubts.
Boost your Prep!