# GATE1994-1.19, ISRO2016-31

5.7k views

Algorithm design technique used in quicksort algorithm is?

1. Dynamic programming

2. Backtracking

3. Divide and conquer

4. Greedy method

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

edited

Quick sort uses Divide and Conquer.

edited
Algorithm design technique used in quicksort algorithm is

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

hence ans is (C) Divide and conquer
Ans: C
quick sort algo:

T(n)=T(n-k)+T(k-1)+n

this is an unstable but efficient algorithm to sort large input array and it have only two phase divide and conquer phase ,combine phase is not present here,,,so C option is correct Divide and Conquer technique

## Related questions

1
6.1k views
The recurrence relation that arises in relation with the complexity of binary search is: $T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+\log n$ $T(n) = T\left(\frac{n}{2}\right)+n$
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
The number of flip-flops required to construct a binary modulo $N$ counter is __________