| Shell Sort |
|
|
|
|
|
|
|
|
|
|
|
| • | The
shell sort is similar to the insertion sort, |
|||||||||
| except
it solves the problem of moving the |
||||||||||
| items
only one step at a time. |
||||||||||
| • | The
idea with the shell sort is to compare |
|||||||||
| keys
that are farther apart, and then resort a |
||||||||||
| number
of times, until you finally do an |
||||||||||
| insertion
sort |
||||||||||
| • | We
use “increments” to compare sets of data |
|||||||||
| to
essentially preprocess the data |
||||||||||