Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on NP-complete problem solved with biological motors. Parent comment
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.
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)?