| Mergesort |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | If
we implemented this approach using |
||||||||||||
| arrays
--- |
|||||||||||||
| – | If
the total number of items in your list is |
||||||||||||
| m...then
for each merge we must do m-1 |
|||||||||||||
| comparisons. |
|||||||||||||
| – | For
example, if there are 6 items we must do |
||||||||||||
| five
comparisons. |
|||||||||||||
| – | In
addition, there are m moves from the original |
||||||||||||
| location
to some temporary location (and back). |
|||||||||||||