All challenges
Multiple ChoiceBeginner 30s

Insertion Sort

Insertion sort works by:
Options
  1. 1Swapping adjacent elements until no inversions remain
  2. 2Finding the global minimum each pass and placing it first
  3. 3Splitting the array in half, sorting each, then merging
  4. 4Building a sorted portion one element at a time

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