On 07/10/2015 03:48 AM, Nick B wrote:
On Friday, 10 July 2015 at 00:39:16 UTC, Xinok wrote:On Thursday, 9 July 2015 at 21:57:39 UTC, Xinok wrote:I found this paper which describes an in-place algorithm with O(n) time complexity but it's over my head at the moment.... stable 0-1 sorting is possible in O(n) time and O(1) extra space.
Note how /they/ don't mention "complexity". This is because algorithms don't have "complexities". Problems do. (Sorry, pet peeve of mine.)
