News for hackers. Stuff that matters.
Re:NP-complete problem solved with biological motors by gohrt on Sunday February 28, 2016 @02:31AM (#11190217)
Note 1: Comparison sorting is O(n log (n)).

In domains where the range of values is smaller than the number of elements (so there are duplicate values), sorting can be faster.

https://en.wikipedia.org/wiki/Radix_sort

Note 2: for aribtrarily large sticks, is "lowering a sticky horizontal plate" a constant-cost operation? Or is it a factor of K (difference between largest and shortest object)?

There are no comments on this comment yet.