Multiple choice

Which of the following algorithms solves the Quick Sort Problem?

  1. Greedy

  2. Depth-first search

  3. Dyanamic programming

  4. Divide and conquer
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Quick sort uses the divide and conquer paradigm by selecting a pivot element and partitioning the array around it. It then recursively sorts the sub-arrays on either side of the pivot.

Keep practicing — related questions