News for hackers. Stuff that matters.
Re:WikiSort – Fast, stable, O(1) space merge sort algorithm by sorbits on Sunday March 16, 2014 @07:32AM (#7409057)
Big-Oh notation deals with theory, and in theory the cost of a variable is fixed.

Furthermore, an array of size N is normally storing N variables (pointers) not N bits, so calculating storage required in bits relative to the input size (without a unit) is disingenuous.

There are no comments on this comment yet.