GATE CSE 1994 | Question: 1.19, ISRO2016-31

Question

Algorithm design technique used in quicksort algorithm is?

• A. Dynamic programming

• B. Backtracking

• C. Divide and conquer

• D. Greedy method

Answer 1

Answer: Option C.

It is one of the efficient algorithms in Divide and Conquer strategy.

Comments

@Deepak Poonia sir, but there is only divide step in quicksort and no conquer step….so shouldn't it be comparison based algorithm….because this works by comparing and swapping elements using top down approach 

Answer 2

Quick sort uses Divide and Conquer.

Answer 3

Algorithm design technique used in quicksort algorithm is

C. Divide and conquer

Answer 4

Algorithm design technique used in quicksort algorithm is Divide And Conquer.

hence ans is (C) Divide and conquer