Which of the Following Algorithm Design Technique is Used in the Quick Sort Algorithm

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 510

Correct 165

Incorrect 80

Viewed 265

Answers

Guest

Yath Am - 3 weeks ago

Yath Am is saying Divide and conquer is correct answer

Sanju Rebel - 6 months ago

Sanju Rebel from Hyderabad, India is saying Dynamic programming is correct answer

yogender kumar - 7 months ago

yogender kumar from New Delhi, India is saying Dynamic programming is correct answer

Serkie Mekonnen - 8 months ago

Serkie Mekonnen from Dessie, Ethiopia is saying Divide and conquer is correct answer

Narender Kumar - 8 months ago

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.

View Answer

View Answer

View Answer