| Mergesort |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Start
by looking at the merge operation. |
||||||||||||
| – | Each
merge step merges your list in half. |
||||||||||||
| – | If
the total number of elements in the two |
||||||||||||
| segments
to be merged is m then merging the |
|||||||||||||
| segments
requires m-1 comparisons. |
|||||||||||||
| – | In
addition, there are m moves from the original |
||||||||||||
| array
to the temporary array and m moves back |
|||||||||||||
| from
the temporary array to the original array. |
|||||||||||||
| – | 3*m-1
major operations in the merge step |
||||||||||||