| Insertion Sort |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Sort
in class the following: |
|||||||||||
| – | 29,
10, 14, 37, 13, 12, 30, 20 |
|||||||||||
| • | Notice,
the insertion sort uses the idea of |
|||||||||||
| keeping
the first part of the list in correct |
||||||||||||
| order,
once you've examined it. |
||||||||||||
| • | Now
think about the first item in the list. |
|||||||||||
| • | Using
this approach, it is always considered |
|||||||||||
| to be
in order! |
||||||||||||