+1 vote
in Data Structures & Algorithms II by (110k points)
Quick sort is a __________

(a) greedy algorithm

(b) divide and conquer algorithm

(c) dynamic programming algorithm

(d) backtracking algorithm

I got this question in an interview for internship.

My question comes from Quicksort in chapter Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
The correct choice is (b) divide and conquer algorithm

Explanation: Quick sort is a divide and conquer algorithm. Quick sort first partitions a large array into two smaller sub-arrays. And then recursively sorts the sub-arrays.

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

...