Abstract

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 peroformance 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.

Citations