+1 vote
in Data Structures & Algorithms II by (110k points)
Quick sort uses which of the following method to implement sorting?

(a) merging

(b) partitioning

(c) selection

(d) exchanging

I have been asked this question during an interview.

Enquiry is from Sorting topic in section Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
Right answer is (b) partitioning

Explanation: Quick sort makes partitions of the input array about the pivot in order to implement sorting. Thus its method of sorting is called partitioning.

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.