|
|
|
|
|
|
|
|
|
|
| n | This algorithm
represents |
||||||||
| essentially the
same number of |
|||||||||
| steps as the
selection sort. |
|||||||||
| n | If make a pass
through the list |
||||||||
| without
interchanging, then the list |
|||||||||
| is ordered. This
makes the |
|||||||||
| algorithm fast if
it is mostly |
|||||||||
| ordered. |
|||||||||