5 years ago in Data Structure

# Which of the following algorithm design technique is used in the quick sort algorithm?

[A] Dynamic programming
[B] Backtracking
[C] Divide and conquer
[D] Greedy method

## Overall Stats

Attempted 354
Correct 161
Incorrect 33
Viewed 160

merna peter - 2 weeks ago

merna peter is saying Dynamic programming is correct answer

Narender Kumar - 3 weeks ago

Narender Kumar is saying Divide and conquer is correct answer

Marem Husen - 1 month ago

Marem Husen from Al Musayyib, Iraq is saying Divide and conquer is correct answer

deepak kumar - 1 month ago

deepak kumar is saying Divide and conquer is correct answer

Uga Balu - 1 month ago

Uga Balu from Chennai, India is saying Divide and conquer is correct answer

## Related Questions

### Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?

• [A] 3,4,5,1,2
• [B] 3,4,5,2,1
• [C] 1,5,2,3,4
• [D] 5,4,3,1,2

### The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

• [A] 2 deletions and 3 additions
• [B] 3 additions and 2 deletions
• [C] 3 deletions and 3 additions
• [D] 3 deletions and 4 additions

### Linked list are not suitable data structure of which one of the following problems ?

• [A] Insertion sort
• [B] Binary search
• [D] Polynomial manipulation

• [A] 11
• [B] 12
• [C] 13
• [D] 14

### Queue can be used to implement ?

• [A] quick sort
• [B] merge sort
• [C] heap sort
• [D] insertion sort