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

(a) backtracking

(b) greedy algorithm

(c) divide and conquer

(d) dynamic programming

I have been asked this question in homework.

The query is from Sorting topic in chapter Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
Correct answer is (c) divide and conquer

To explain: Quick sort uses the technique of divide and conquer in order to sort a given array. It divides the array into two parts about the pivot and then apply a quick sort to both the parts.

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.