Re:I No Longer Need StackOverflow
by zaptheimpaler on Monday February 17, 2014 @10:54AM
(#7252596)
Well keep in mind that the inputs to the algorithm can vary. Randomization can help avoid a bad input from throwing your algorithm off. A simple example of how randomization helps is quicksort:
if we pick the pivot to always be the first element, then any sorted array will cause worst-case running time. But by randomizing the pivot, we can do well (in expectation) for any input.
I'd expect that it's simply that the additional constraints implied by requiring deterministic behavior precludes certain optimizations that can lead to improved running time.
Iow, if you can never do X, then you cannot write any algorithm that may do X.
Am I missing some critical piece of understanding here?