News for hackers. Stuff that matters.

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

Re:How Inefficient Can a Sort Algorithm Be? (2012) [pdf] by smartstakestime on Tuesday March 19, 2019 @04:07AM (#19428926)
O(2 * n)
[ Parent | on HN ]
Re:How Inefficient Can a Sort Algorithm Be? (2012) [pdf] by anonytrary on Tuesday March 19, 2019 @04:48AM (#19429105)
O(2*n) == O(n)
[ Parent | on HN ]
Re:How Inefficient Can a Sort Algorithm Be? (2012) [pdf] by augustk on Tuesday March 19, 2019 @05:23AM (#19429250)
Or with common mathematical notation: O(2*n) = O(n)
[ Parent | on HN ]