Dynamic array

A dynamic array is an array whose backing storage can grow as entries are appended. Dynamic array doubling is one growth policy with a deterministic amortized analysis.

 Ancestors (4)

 Incoming links (10)

Circular buffer operation costs
Dynamic array
Dynamic array doubling
Jonas Almström Duregård
Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Imperative programming / 7 / a / Solution
Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming / 7 / b / Solution
Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 6 / a / Solution
Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Functional programming, design and analysis of algorithms / 7 / c / Solution
Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Imperative programming (resit) / 6 / a / ii / Solution
Performance Characteristics of Scala 2.13 collections

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Dynamic array by

Ciro Santilli  40 Updated 2025-07-16

 Read the full article

  See all articles in the same topic Create my own version