The quick sort algorithm exploit ................. design technique.
A. Greedy
B. Dynamic programming
C. Divide and Conquer
D. Backtracking
Answer:C
The quick sort algorithm exploit ................. design technique.
A. Greedy B. Dynamic programming C. Divide and Conquer D. Backtracking