Sign in
Please select an account to continue using cracku.in
↓ →
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:
Terms of Service
CAT Formulas PDF CAT Exam Syllabus PDF CAT Study Plan PDF Cracku Brochure
Quick, Easy and Effective Revision
By proceeding you agree to create your account
Free CAT Formulas PDF will be sent to your email address soon !!!