Multiple choice Which of the following algorithms solves the quick sort problem? Greedy Depth-First Search Dyanamic Programming Divide & Conquer Reveal answer Fill a bubble to check yourself D Correct answer Explanation Quick sort uses the divide and conquer paradigm by partitioning the array around a pivot and recursively sorting the sub-arrays.