Multiple choice

Which of the following algorithms solves the quick sort problem?

  1. Greedy

  2. Depth-First Search

  3. Dyanamic Programming

  4. 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.