| Mergesort |
|
|
|
|
|
|
|
|
|
|
| • | The
mergesort is considered to be a divide and |
||||||||
| conquer
sorting algorithm (as is the quicksort ). |
|||||||||
| • | The
mergesort is a recursive approach which is |
||||||||
| very
efficient. |
|||||||||
| • | The
mergesort can work on arrays, linked lists, or |
||||||||
| even
external files. |
|||||||||
| • | At
first glance, it doesn’t seem like a sorting |
||||||||
| algorithm
at all... |
|||||||||