Which of the following algorithm design technique is used in the quick sort algorithm?

• [A] mn
• [B] max(m,n)
• [C] min(m,n)
• [D] m+n-1

• [A] 2 deletions and 3 additions
• [B] 3 additions and 2 deletions
• [C] 3 deletions and 3 additions
• [D] 3 deletions and 4 additions

• [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] Dynamic programming
• [B] Backtracking
• [C] Divide and conquer
• [D] Greedy method

• [A] 3
• [B] 9
• [C] 7
• [D] 5