Sort one sequence by O(n) in time and O(1) in space

[Gregory Ewing]

Steven D'Aprano wrote:
> Secondly, O(N*log N) applies to *comparison sorts*. Non-comparison sorts 
> such as radix-, counting- and bucket-sort have average case complexity of 
> O(N).

They require additional space, though.

-- 
Greg