Amortized analysis of algorithms is a method of considering multiple operations at once in order to simplify the calculation of the total run time complexity. In this video, I explain the basics of amortized analysis with several examples.
We will cover the aggregate method and the banker's method.
The examples are on Array Doubling, Hash Table Doubling, and The Binary Counter.
=========================
In this channel I provide clear explanation of Algorithms, Data Structures, and Programming in C++, NodeJS, and Javascript.
Most of my content are targeted for students in computer science and computer engineering who are preparing for technical job interviews.
