| Insertion Sort |
|
|
|
|
|
|
|
|
|
|
|
|
| • | Notice
that with an insertion sort, even after |
||||||||||
| most
of the items have been sorted, |
|||||||||||
| – | the
insertion of a later item may require that you |
||||||||||
| move
MANY of the numbers. |
|||||||||||
| – | We
only move 1 position at a time. |
||||||||||
| – | Thus,
think about a list of numbers organized in |
||||||||||
| reverse
order? How many moves do we need to |
|||||||||||
| make? |
|||||||||||