News for hackers. Stuff that matters.
Re:WikiSort – Fast, stable, O(1) space merge sort algorithm by makomk on Sunday March 16, 2014 @07:15AM (#7409016)
In practice, though, it makes sense in this case to assume integers representing array indices are constant-space and arithmetic on them takes constant time. The computers we're running these algorithms on use base 2 and the size of integer they can operate on in a single operation has scaled nicely with the amount of storage they have access to.

There are no comments on this comment yet.