7 years ago
in Data Structure
Which of the following algorithm design technique is used in the quick sort algorithm?
Loading...
Overall Stats
Attempted
312
Correct
97
Incorrect
52
Viewed
163
Answers
JYOTI PRIYA Devi -
2 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
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
Merge sort uses ?
- [A] Divide and conquer strategy
- [B] Backtracking approach
- [C] Heuristic search
- [D] Greedy approach
What is the result of the following operation Top (Push (S, X))
- [A] X
- [B] null
- [C] s
- [D] none of these
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