2010-10-22, 06:32 AM
Russt Wrote:I don't know of any sequential data structure for which both insertion and random access (which is needed for the binary search you're describing) are O(1).
Fibonacci-heaps does that I think. (Messy though)

