Mergesort rearranges N items into ascending order.
MergeSort Class
| Operation | Description | Complexity |
|---|---|---|
void sort(Comparable[] a) |
Sort the items array | N log N |
MergeSort approach
- divide array into two halves
- recursively sort each half
- merge two halves
This repository was archived by the owner on May 18, 2020. It is now read-only.