Amortized Analysis of a String Pattern
Unsure how to solve the question in the picture. provide an example. Also, what would the potential function look like? Is the actual running time of this algorithm O(n+m)? What would be the amortized analysis of something like this?
