All challenges
Multiple ChoiceIntermediate 180s

[Algorithms] Worst O(n²) Divide and conquer with pivot

When array is already sorted (naive pivot).
Options
  1. 1Binary search
  2. 2Quicksort
  3. 3BFS
  4. 4Dynamic programming

Think you can answer under pressure?

Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.

Play this in a 3-minute battle