Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with amortized-analysis
Search options not deleted
user 12623
A method in analysis of algorithms that considers the overall cost of a sequence of operations.
1
vote
0
answers
49
views
Is it true that the potential method is usually the inverse of the accounting method in the ...
I remember reading this somewhere (will post the source as soon as I find it), but was wondering, if anyone knows why this is true or has maybe an example to portray why this is the case.
- 3,090
2
votes
1
answer
110
views
Why does the total credit associated with a data structure must be nonnegative at all times ...
I was reading CLRS and it said in the chapter for the accounting method (for amortized analysis):
the total credit associated with the data the structure must
be nonnegative at all times.
wher …
- 3,090
6
votes
1
answer
5k
views
Why is the path compression (no rank) for disjoint sets $O(\log n)$ amortized for Find-Set?
I was trying to understand why using only path compression (no rank) would yield $m log(n) $ total run time for a sequence of $m$ operations for Find-Set.
I was told that the potential function:
$$ …
- 3,090