igushev's comments

igushev | 6 years ago | on: Show HN: Array with Constant Time Access and Fast Insertion and Deletion

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.
page 1