The Universal Data Structure

Re:The Universal Data Structure by brudgers on Tuesday June 30, 2015 @06:34PM (#9808847)

Since we call cases where something that looks polynomial on the surface but actually performs in NP "pseudo-polynomial," does it makes sense to call the cases where something more or less takes constant time "pseudo-logarithmic?"

[ Parent | on HN ]

Re:The Universal Data Structure by robrenaud on Tuesday June 30, 2015 @07:21PM (#9809023)

Well, there are terms linearithmic and quasilinear that already get some usage.

> https://en.wikipedia.org/wiki/Time_complexity#Quasilinear_ti...

[ Parent | on HN ]

Re:The Universal Data Structure by Cushman on Wednesday July 01, 2015 @01:47PM (#9813751)

Or maybe, since O(1) is in O(log n), you can cover your bases by just calling everything logarithmic regardless :)

[ Parent | on HN ]