Jump to content

Talk:Accounting method (computer science)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Velle~enwiki (talk | contribs) at 23:29, 7 January 2010 (Does it work for other than constant amortized time?: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

hi every body,

               Can any one explain the accounting method with a diagram .

Does it work for other than constant amortized time?

It says in the article "is most naturally suited for proving a O(1) bound", but I do not really understand this sentence. Is it "naturally suited" (and only suited) for this? Or is proving O(1) what it is most suitable for, while it is applicable but less "suitable" for proving other running times?

If it does work for proving other amortised running times, e.g. log n, then it would be really nice with a link to a demonstration this use.

Velle (talk) 23:29, 7 January 2010 (UTC)[reply]