Efficient data structure for fast random access, search, insertion and deletion

Question

I\'m looking for a data structure (or structures) that would allow me keep me an ordered list of integers, no duplicates, with indexes and values in the same range.

I ne

Answer 1

Use a vector for the array access.

Use a map as a search index to the subscript into the vector.

• given a subscript fetch the value from the vector O(1)
• given a key, use the map to find the subscript of the value. O(lnN)
• insert a value, push back on the vector O(1) amortized, insert the subscript into the map O(lnN)
• delete a value, delete from the map O(lnN)