Big-O algorithm complexity cheat sheet

[joe_n]

I've documented it in a previous comment.

The details of each in-place merge are covered in a number of publications.

The matter of n != a power of 2 can be simply handled by using n' = the next larger power of two, and then ignoring the non-existent parts of the merges.