News for hackers. Stuff that matters.

A comment on How Inefficient Can a Sort Algorithm Be? (2012) [pdf]. Parent comment

Re:How Inefficient Can a Sort Algorithm Be? (2012) [pdf] by bjoli on Tuesday March 19, 2019 @11:32AM (#19431754)
Then check if it's sorted. If it is not, double the sleep time increments to make it more tolerant to scheduler error.
[ Parent | on HN ]

There are no comments on this comment yet.