Lecture 18: Amortized Analysis (Aggregate Method), Ordered Dictionary ADT [Advanced Data Structures]

In this lecture we consider amortized analysis. We do a few examples of using the aggregate method. In particular, using amortized analysis, we address both theoretically and practically the question of which standard way of resizing an array is efficient. That is, I address which of geometric growth of an array when full or growing it by a constant amount is more efficient? We conclude the lecture by introducing the Ordered Dictionary ADT (for our next major topic).

Want the notes, and/or want to support my mission? Look no further, get the written companion to this video lectures series. Buy the book, Advanced Data Structures: An Introduction to Data Structures and Algorithms, it is available at the below links (by format, given in parentheses):

Supporters (to date of publication, by tier):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Tor Asbjørn Bekkelund
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:

Time Stamps:
0:00 Amortized Analysis reminder and setup
1:40 Quick Analysis of Put Operations on Sorted Array Dictionary
4:06 Why consider amortization?
5:50 Is the doubling/geometric re-sizing method effective?
29:28 Growth factors.
31:10 Is growing an array by a constant quantity effective?
42:48 Some remarks beyond this on amortized analysis.
46:30 Ordered Dictionary ADT

#Amortization
#DataStructures
#Algorithms