Algorithms and Data Structures

Volume 1663 of the series Lecture Notes in Computer Science pp 205-216


Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences

  • Michael T. GoodrichAffiliated withJohns Hopkins Univ.
  • , John G. KlossIIAffiliated withJohns Hopkins Univ.

* Final gross prices may vary according to local VAT.

Get Access


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.


abstract data type vector dynamic array Java JDSL