Home

Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

A. mn

B. max(m,n)

C. min(m,n)

D. m+n-1

Study and Earn Android App
Share this question with your friends

Correct Answer : D.


Please do not use chat terms. Example: avoid using "grt" instead of "great".

Submit
Load More..

Also checkout

Drawing Inference MCQ Refrigeration & Air-Conditioning MCQ Puzzle MCQ Indian Polity & Economy MCQ Gravitation MCQ Microsoft PowerPoint MCQ Compound Interest MCQ Lower urinary tract trauma MCQ Data Structure MCQ Internal Combustion MCQ Animal Kingdom MCQ Time and Work MCQ