News for hackers. Stuff that matters.

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

Re:Show HN: Array with Constant Time Access and Fast Inserti... by enriquto on Wednesday September 04, 2019 @04:02AM (#20874975)
cool! looks like from that, you could maybe

1. extend the construction to three dimensions, so that the insertion cost is a cubic root?

2. iterate the extension to an increasing number of dimensions, so that the cost becomes logarithmic?

[ Parent | on HN ]
Re:Show HN: Array with Constant Time Access and Fast Inserti... by igushev on Wednesday September 04, 2019 @01:10PM (#20879228)
I mentioned that extension in the published paper, but complexity of access becomes O(d) where d is number of dimensions.
[ Parent | on HN ]