Which of the following algorithm design technique is used in the quick sort algorithm?
Yath Am is saying Divide and conquer is correct answer
Sanju Rebel from Hyderabad, India is saying Dynamic programming is correct answer
yogender kumar from New Delhi, India is saying Dynamic programming is correct answer
Serkie Mekonnen from Dessie, Ethiopia is saying Divide and conquer is correct answer
Narender Kumar is saying Divide and conquer is correct answer
- [A] Optimal binary search tree construction can be performed efficiently using dynamic programming.
- [B] Breath first search cannot be used to find converted components of a graph.
- [C] Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
- [D] Depth first search can be used to find connected components of a graph.
- [A] Stack
- [B] Set
- [C] List
- [D] Queue
- [A] Dynamic programming
- [B] Backtracking
- [C] Divide and conquer
- [D] Greedy method