News for hackers. Stuff that matters.
Re:NP-complete problem solved with biological motors by Filligree on Sunday February 28, 2016 @08:26AM (#11190859)
But isn't this just radix sort, effectively? That's linear-time, no problem. There's no fundamental rule saying that sorting has to be O(n lg n), it's only sorting-by-comparison that needs O(N lg n) comparisons.

Though I guess one might point out that, without direct (and infinitely precise!) comparisons, eventually you'll have enough sticks that you won't really be able to tell which is the largest.

There are no comments on this comment yet.