| Insertion Sort |
|
|
|
|
|
|
|
|
|
|
| • | For
small arrays - fewer than 50 - the |
||||||||
| simplicity
of the insertion sort makes it a |
|||||||||
| reasonable
approach. |
|||||||||
| • | For
large arrays -- it can be extremely |
||||||||
| inefficient! |
|||||||||
| • | However,
if your data is close to being |
||||||||
| sorted
and a right->left comparison |
|||||||||
| method
is used, with LLL this can be |
|||||||||
| greatly
improved |
|||||||||