News for hackers. Stuff that matters.

A comment on Show HN: Array with Constant Time Access and Fast Insertion and Deletion. Parent comment

Re:Show HN: Array with Constant Time Access and Fast Inserti... by saagarjha on Wednesday September 04, 2019 @01:34AM (#20874297)
> In C++ the std::vector type handles this by doubling the capacity when full.

Of course, the growth factor is implementation-dependent and I believe some compilers use smaller growth factors to improve performance.

[ Parent | on HN ]
Re:Show HN: Array with Constant Time Access and Fast Inserti... by rurban on Wednesday September 04, 2019 @03:24AM (#20874784)
Th optimal growth factor is the golden ratio 1+sqrt(5) [1.618], but 2 is much faster to calculate.
[ Parent | on HN ]
Re:Show HN: Array with Constant Time Access and Fast Inserti... by saagarjha on Thursday September 05, 2019 @01:06AM (#20883990)
Is calculating the new size really the bottleneck here?
[ Parent | on HN ]