News for hackers. Stuff that matters.
Re:NP-complete problem solved with biological motors by solipsism on Sunday February 28, 2016 @02:47AM (#11190243)
O(nlogn) is the bound for a serial version of the algorithm. A head that can read or write one value (stick) at a time. Parallel sorts achieve better bounds. Your sticky horizontal plate is essentially N parallel reads, each scanning through values, continually asking if it's reached its stick.

There are no comments on this comment yet.