# GATE1994-1.19, ISRO2016-31

14 votes
5.7k views

Algorithm design technique used in quicksort algorithm is?

1. Dynamic programming

2. Backtracking

3. Divide and conquer

4. Greedy method

## 6 Answers

24 votes

Best answer

Answer: Option C.

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

edited
8 votes

Quick sort uses Divide and Conquer.

edited
7 votes
Algorithm design technique used in quicksort algorithm is

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

hence ans is (C) Divide and conquer
3 votes
Ans: C
0 votes
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
Answer:

## Related questions

20 votes
8 answers
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$
33 votes
6 answers
2
11.7k views
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
15 votes
1 answer
3
2.3k views
The number of flip-flops required to construct a binary modulo $N$ counter is __________
12 votes
3 answers
4
1.5k views
Which of the following conversions is not possible (algorithmically)? Regular grammar to context free grammar Non-deterministic FSA to deterministic FSA Non-deterministic PDA to deterministic PDA Non-deterministic Turing machine to deterministic Turing machine