Insertion Sort is the algorithm Python's Timsort uses for arrays under 64 elements. Not just a teaching tool — it's in production in the world's most popular runtime.

🃏 The Core Idea

Pick up playing cards one by one. Each new card gets inserted into the correct position among the cards already in your hand — comparing right to left until it finds its spot.

Take 3 → shift 5 → insert → [3, 5, 8, 1, 4]

Take 8 → 8 > 5, no shift → [3, 5, 8, 1, 4]