Insertion Sort I

• The list is assumed to be broken into a sorted portion and an unsorted portion

• Keys will be inserted from the unsorted portion into the sorted portion.

Sorted

Unsorted

Previous slide

Next slide

Back to first slide

View graphic version