+1 vote
in Data Structures & Algorithms II by (110k points)
Quick sort is a space-optimised version of ____

(a) Bubble sort

(b) Selection sort

(c) Insertion sort

(d) Binary tree sort

The question was posed to me in class test.

My question is from Quicksort in portion Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
The correct option is (d) Binary tree sort

The explanation is: Quick sort is a space-optimised version of the binary tree sort. In binary sort tree, the elements are inserted sequentially into the binary search tree and Quick sort organises elements into a tree that is implied by the recursive calls.

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

...