# Search Results

Results tagged with Search options answers only user 2205
4 results

A method in analysis of algorithms that considers the overall cost of a sequence of operations.

Let $a_i$ be the amortized costs of operation $i$, $c_i$ be the actual costs of operation $i$, and $D_i$ the data structure after operation $i$. The amortized costs of an operation are defined as a …
answered Jan 18 '13 by A.Schulz
Try the following: The weight $w_i$ of an element $i$ in the heap $H$ is its depth in the corresponding binary tree. So the element in the root has weight zero, its two children have weight 1 and so …
answered Jan 12 '13 by A.Schulz
It does change the complexity of the operations. Simply speaking, the root list $W$ gets too large. We have two expensive operations, which are ExtractMin and DecreaseKey. Remember that the amortized …
answered Dec 19 '12 by A.Schulz
How about this. Assume we maintain a binary counter $C$ that counts the operations executed so far. Let $D_i$ be the data structure after the $i$-th operation. We then define as potential $\Phi(D_i)$ …
answered May 18 '14 by A.Schulz