Re:Show HN: Array with Constant Time Access and Fast Inserti...
by igushev on Wednesday September 04, 2019 @01:44AM
(#20874339)
That is true. The complexities in Big O notations, but I put all real-life measurements in README.md, so readers could see. On small item counts the complexity of data structure itself makes it performs worse comparing to std::vectors, only on large item counts it performs betters.
Note that access is slower then std::vector due to complexity of data structure but multiplier is always the same.
[ Parent
| on HN ]
There are no comments on this comment yet.