Edit MetaData
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:
Login to your Cracku account.
Enter Valid Email
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!
Quick, Easy and Effective Revision
By proceeding you agree to create your account
Free CAT Formulae PDF will be sent to your email address soon !!!
Join cracku.in for Expert Guidance.