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 Aldehydes and Ketones MCQ Syllogism MCQ Data Structure MCQ Phylum - Arthropoda MCQ Active and Passive Voice MCQ Construction Planning and Management MCQ Alkyl and Aryl Halides MCQ Reproductive System MCQ Tumors of the prostate MCQ Additional Chemistry (Inorganic) MCQ DBMS MCQ