English, asked by manoj2000, 1 year ago

The quick sort algorithm exploit _________ design technique

Greedy

Dynamic programming

Divide and Conquer

Backtracking


Answers

Answered by amritansh6239
1
backtracking is the right answer
Similar questions