These are part of my notes for the Coursera course: Algorithms, Pt I (Princeton).
Information on basic Mergesort can be found here.
##Bottom-Up Mergesort
####Concept
- we know :
- normal Mergesort recurs, halving the array until we hit sub-arrays/ranges of size
1
- it is only from here that sorting starts to happen
- normal Mergesort recurs, halving the array until we hit sub-arrays/ranges of size
- instead of recurring down from the full array, start with ranges of size
1