Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences

  • Michael T. Goodrich
  • John G. KlossII
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1663)

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

Keywords

abstract data type vector dynamic array Java JDSL 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Michael T. Goodrich
    • 1
  • John G. KlossII
    • 1
  1. 1.Johns Hopkins Univ.BaltimoreUSA

Personalised recommendations