7 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 312
Correct 97
Incorrect 52
Viewed 163

JYOTI PRIYA Devi - 9 months ago

JYOTI PRIYA Devi from Guwahati, India is saying Divide and conquer is correct answer

Shourya Singh Rawat - 4 years ago

Shourya Singh Rawat from India is saying Dynamic programming is correct answer

Lets Know - 4 years ago

Lets Know from Pakistan is saying Divide and conquer is correct answer

Baerov Bogdan - 4 years ago

Baerov Bogdan from Mogosoaia, Romania is saying Divide and conquer is correct answer

Rohan Bhosale - 4 years ago

Rohan Bhosale from Pune, India is saying Divide and conquer is correct answer

## Related Questions

• [A] Stack
• [B] Set
• [C] List
• [D] Queue

### The following sequence of operation is performed on stack : push(1),push(2),pop,push(1),push(2),pop,pop,pop,push(2),pop. The sequence of popped out values are ?

• [A] 2,2,1,1,2
• [B] 2,2,1,2,2
• [C] 2,1,2,2,1
• [D] 2,1,2,2,2

### The postfix expression for * + a b - c d is?

• [A] ab + cd - *
• [B] ab cd + - *
• [C] ab + cd * -
• [D] ab + - cd *

• [A] Intertel
• [B] Telenet
• [C] VoIP
• [D] VoRP