Sorting & Big-O notation review
Post date: Sep 28, 2016 10:7:41 PM
mergesort:
Bottom-up, after each recursion, it is ensured that the subsets are sorted, then they must be merged.
Merging the two sorted subsets by using an extra storage space and pulling from them
pivotsort:
Top-down, partition first, then work on subsets.
Pull all values below the pivot to beginning indices.
For an implementation, see https://github.com/long0612/randProbs
For big-O notation, see https://en.wikipedia.org/wiki/Big_O_notation#Family_of_Bachmann.E2.80.93Landau_notations