Insertion Sort

Definition

Builds the final sorted array one item at a time by taking an element from the unsorted list and inserting it into its correct position in the sorted list. Best case O(N) if already sorted, worst case O(N^2).

Explain Like I'm New

Sorting a hand of playing cards. You pick up a card, look at your hand, and slide it exactly between the two cards it belongs between.

Interactive Coding Challenges

Identify the core logic required to implement Insertion Sort.

Solution Code

Console output will appear here...