GATE 2021 CS-Set-2
October 12, 2023Algorithms
October 12, 2023Algorithms
| Question 36 |
Which of the following algorithm design techniques is used in the quicksort algorithm?
| Dynamic programming | |
| Backtracking | |
| Divide and conquer | |
| Greedy method |
Question 36 Explanation:
In quick sort, we use divide and conquer technique.
Correct Answer: C
Question 36 Explanation:
In quick sort, we use divide and conquer technique.
Subscribe
Login
0 Comments