The quick sort algorithm exploit _________ design technique
Greedy
Dynamic programming
Divide and Conquer
Backtracking
Answers
Answered by
1
backtracking is the right answer
Similar questions
Math,
7 months ago
English,
7 months ago
Political Science,
1 year ago
Biology,
1 year ago
Math,
1 year ago