Skip to main content

🎮 Sorting (Practice)

Companion to the Sorting Algorithms guide. Watch bubble sort settle elements one by one, then implement insertion sort yourself.

🎬 Watch it work​

Bubble Sort — adjacent compare & swapStep 1 / 23
5
2
8
1
4
Unsorted. Bubble sort compares adjacent pairs and swaps if out of order.

🐍 Your turn​

Loading editor…

🧠 Challenge yourself​

  1. Modify it to sort in descending order.
  2. Count the number of swaps — which input order maximizes them?
  3. Why is insertion sort O(n) on an already-sorted array but O(n²) worst case?

Continue the path → Stacks & Queues