Questions tagged [dynamic-array]
7 questions
3
votes
2 answers
Amortized analysis on a dynamic table that grows its size by $\sqrt{size} $
The following problem is based on the section about dynamic table as part of the discussion about amortized analysis in CLRS
Problem: We are given a dynamic table $T$ that supports INSERT operation, implemented as an array and allows a constant…
flamel12
- 243
- 2
- 9
1
vote
3 answers
Can there exist a deque like data structure that supports amortized $O(1)$ random access?
A lot of modern languages usually have a "list" or "vector" structure which allows for amortized $O(1)$ append and removal from back as well as amortized $O(1)$ random access.
I'm curious if a double sided (deque) style data structure can exist that…
Sidharth Ghoshal
- 375
- 1
- 2
- 10
1
vote
0 answers
Finding the total work of an array list expansion effort
Suppose we are given an array-based list data structure. Suppose that its initial capacity is
$m > 0.$ When appending an element to the end of the list, if the list is full, we extend its capacity by $d > 0$ array components, copy the old content,…
coderodde
- 60
- 1
- 13
1
vote
1 answer
Aggregate method for dynamic table (amortized analysis)
For amortized analysis (aggregate method), dynamic table insertion cost can be divided into:
if no expansion, then cost = 1
if we expand the table, then cost = i (if i-1 is an exact power of 2)
then the total cost is
I don't understand how to get…
ryan chandra
- 123
- 4
0
votes
1 answer
Why are dynamic arrays called ArrayLists in Java?
The point of Java's ArrayLists is that they adjust their length automatically whenever items are inserted or deleted. If I understand it correctly, ArrayLists are wrappers around primitive arrays.
I was taught that:
arrays are data structures that…
Pixelcode
- 103
- 2
0
votes
1 answer
Prove with potential method that dynamic table with $q > 1$ expansion runs in amortized constant time
Suppose I have a dynamic table supporting $Insert$ procedure, which sets an input value after the tail of the dynamic table. If the underlying table is already full, we multiply its size by $q > 1$. (I have proof that that arrangement leads to…
coderodde
- 60
- 1
- 13
0
votes
2 answers
Big O of dynamic array
Skiena's Algorithm Design Manual, 3rd Ed p.71 gives the time complexity of a dynamic array according to the number of movements, $M$, as:
$$
M = n + \sum_{i=1}^{lg(n)} 2^{i-1} = 1 +2+ 4+\ldots+\frac{n}{2} + n \stackrel{?}{=} \sum_{i=0}^{lg(n)}…
Lorem Ipsum
- 113
- 4