I read about Potential Method when I was trying to understand some calculations.

I just can't understand how do you perform the calculation it self. How can you even define $O(n)-O(n)$ as it is used in the Wikipedia page? I just don't understand where is the calculation done.

Is there any good and simple example of this kind of analysis?

Shay

  • 3
    The Wikipedia article uses variable-length arrays with size doubling as an example. This is a good example, but the explanation in the Wikipedia article is next to incorrect. It is correct that the amortized cost of the insertion when the expansion occurs is O(1), but not because it is O(n)−O(n). – Tsuyoshi Ito Sep 11 '11 at 20:56
  • Yes I understand that, I actually proved that once in a much simpler way. Do you know any better explanation online (article, video, doesn't matter)? – Shay Ben Moshe Sep 11 '11 at 20:59
  • indeed. In fact the original explanation in the table expansion article is essentially a potential method, but correctly explained. – Suresh Venkat Sep 11 '11 at 21:00
  • 4
  • @jbapple make this an answer so it can be accepted, preventing Community from bumping it up again and again ? – Suresh Venkat Sep 12 '11 at 17:04

Your Answer

 
discard

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.