+1 vote
in Data Structures & Algorithms II by (110k points)
Which of the following is not a variant of merge sort?

(a) in-place merge sort

(b) bottom up merge sort

(c) top down merge sort

(d) linear merge sort

This question was addressed to me in an interview for job.

This intriguing question originated from Sorting topic in section Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Correct choice is (d) linear merge sort

The best I can explain: In-place, top down and bottom up merge sort are different variants of merge sort. Whereas linear merge sort is not a possible variant as it is a comparison based sort and the minimum time complexity of any comparison based sort is O(n log n).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...