Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1999: Algorithms and Data Structures pp 37–48Cite as

Resizable Arrays in Optimal Time and Space

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1663))

Abstract

We present simple, practical and efficient data structures for the fundamental problem of maintaining a resizable one-dimensional array, A[l..l + n − 1], of fixed-size elements, as elements are added to or removed from one or both ends. Our structures also support access to the element in position i. All operations are performed in constant time. The extra space (i.e., the space used past storing the n current elements) is O(√n) at any point in time. This is shown to be within a constant factor of optimal, even if there are no constraints on the time. If desired, each memory block can be made to have size 2k − c for a specified constant c, and hence the scheme works effectively with the buddy system. The data structures can be used to solve a variety of problems with optimal bounds on time and extra storage. These include stacks, queues, randomized queues, priority queues, and deques.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Brodnik. Computation of the least significant set bit. In Proceedings of the 2nd Electrotechnical and Computer Science Conference, Portoroz, Slovenia, 1993.

    Google Scholar 

  2. A. Brodnik, S. Carlsson, E. D. Demaine, J. I. Munro, and R. Sedgewick. Resizable arrays in optimal time and space. Technical Report CS-99-09, U. Waterloo, 1999.

    Google Scholar 

  3. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SICOMP, 23(4):738–761, Aug. 1994.

    MathSciNet  MATH  Google Scholar 

  4. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. JCSS, 47(3):424–436, 1993.

    MathSciNet  MATH  Google Scholar 

  5. M. T. Goodrich and J. G. Kloss II. Tiered vector: An efficient dynamic array for JDSL. This volume.

    Google Scholar 

  6. D. E. Knuth. The Art of Computer Programming. Addison-Wesley, 1968.

    Google Scholar 

  7. M. K. McKusick, K. Bostic, M. J. Karels, and J. S. Quarterman. The Design and Implementation of the 4.4 BSD Operating System. Addison-Wesley, 1996.

    Google Scholar 

  8. R. Motwani and P. Raghavan. Randomized Algorithms. Camb. Univ. Press, 1995.

    Google Scholar 

  9. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes in C: The Art of Scientific Computing. Camb. Univ. Press, 2nd ed., 1992.

    Google Scholar 

  10. R. Sedgewick. Algorithms in C. Addison-Wesley, 3rd ed., 1997.

    Google Scholar 

  11. B. Stroustrup. The C++ Programming Language. Addison-Wesley, 3rd ed., 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Theoretical Computer Science, Institute of Mathematics, Physics, and Mechanics, Jadranska 19, 1111, Ljubljana, Slovenia

    Andrej Brodnik

  2. Dept. of Computer Science and Electrical Engineering, Luleå University of Technology, S-971 87, Luleå, Sweden

    Andrej Brodnik & Svante Carlsson

  3. Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

    Erik D. Demaine & J. Ian Ian Munro

  4. Dept. of Computer Science, Princeton University, Princeton, NJ, 08544, USA

    Robert Sedgewick

Authors
  1. Andrej Brodnik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Svante Carlsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erik D. Demaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. Ian Ian Munro
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Robert Sedgewick
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. School of Computer Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6

    Arvind Gupta

  3. Center for Geometric Computing Providence, Brown University, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brodnik, A., Carlsson, S., Demaine, E.D., Ian Ian Munro, J., Sedgewick, R. (1999). Resizable Arrays in Optimal Time and Space. 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. https://doi.org/10.1007/3-540-48447-7_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-48447-7_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66279-2

  • Online ISBN: 978-3-540-48447-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation