Goodrich M.T., Kloss J.G. (1999) Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. In: Dehne F., Sack JR., Gupta A., Tamassia R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg
We describe a data structure, the tiered vector, which is an implementation of the Vector ADT that provides O(1/∈)worst case time performance for rank-based retrieval and O(n∈) amortized time performance for rank-based insertion and deletion, for any fixed ∈ > 0. We also provide results from experiments involving the use of the tiered vector for ∈ = 1/2 in JDSL, the Data Structures Library in Java.