News for hackers. Stuff that matters.

A comment on The time complexity of the libc++ deque push_front implementation is O(log n). Parent comment

Re:The time complexity of the libc++ deque push_front implem... by colanderman on Sunday November 28, 2021 @01:28PM (#29371418)
To be clear, that is not the advice I'm giving -- but rather, when your performance looks like p*log n + q, if q is much greater than p/40 -- that is, the constant term dwarfs the logarithmic term -- then it is safe to consider it constant.
[ Parent | on HN ]
Re:The time complexity of the libc++ deque push_front implem... by xdavidliu on Sunday November 28, 2021 @02:56PM (#29372327)
> p*log n + q, if q is much greater than p/40 -- that is, the constant term dwarfs the logarithmic term

I think you meant to say "if q is much greater than p TIMES 40".

[ Parent | on HN ]
Re:The time complexity of the libc++ deque push_front implem... by colanderman on Sunday November 28, 2021 @05:55PM (#29374053)
Ah good catch, yes you are correct.
[ Parent | on HN ]