.. (לתיקייה המכילה) | ||
Last Updated: 20.6.2012
- 22.6 - Added 4.
- 21.6 - Added 3.
- 21.6 - Added 2.
- 20.6 - Added 1.
- 12.6 - Opened FAQ.
- 22.6 - Added 4.
- 21.6 - Added 3.
- 21.6 - Added 2.
- 20.6 - Added 1.
- 12.6 - Opened FAQ.
1. In question 3: What are n,m and k? | |
In this question, as in most questions, n is the size of the data structure (in our case - the size of the array). k and m are arbitrary positive integers no greater than n. |
2. In question 6, is the graph directed? | |
It does not matter. The algorithm works in the case the graph is directed or undirected. |
3. In question 6, what are n and m? | |
As always, we denote by n the number of vertices and by m the number of edges. |
4. In question 1a, can we assume anything about the types of sequences for which O(1) amortized complexity holds? | |
No. You are given a sequence of operations for which *any* sequence of operations takes O(1) amortized time. Use the definition. |