Sorting in Linear Time

Talk it through with a coach who asks guiding questions and gives hints until you reach the answer. Pass to mark the challenge as completed.

The problem

  • medium
  • Pro

Comparison sorts can't beat n log n in the worst case. Explain why, and how counting sort and radix sort get around that limit for some kinds of data.

Talk this problem through with an AI coach

This is a Pro challenge. Sign in with Google, then upgrade to start a voice session.

Start free →