Re:How Inefficient Can a Sort Algorithm Be? (2012) [pdf]
by frabert on Tuesday March 19, 2019 @09:50AM
(#19430752)
You could consider that in PID control the actual algorithm is the single iteration, after which the output is sent out and a new set of inputs comes in, thus restarting the algorithm. In an endless iteration, you never give out any outputs
[ Parent
| on HN ]
Re:How Inefficient Can a Sort Algorithm Be? (2012) [pdf]
by candiodari on Tuesday March 19, 2019 @12:50PM
(#19432631)
You can't run PID in a single iteration. The integration and differentiation parts would be 0 in any single iteration, and so it's quite PID control if you look at it that way.
The description of the algorithm doesn't make much sense in a single iteration either.