📊 Insertion Sort

Sort by inserting each element into its correct position

How it works: Start from position 1. Take the current element (key) and insert it into the sorted portion on the left by shifting larger elements to the right.
Click "Next Step" to start sorting.
0
Comparisons
0
Shifts
Sorted
Key (inserting)
Comparing
Unsorted