diff options
| author | Andreas Grois <andi@grois.info> | 2024-07-26 23:15:27 +0200 |
|---|---|---|
| committer | Andreas Grois <andi@grois.info> | 2024-07-26 23:15:27 +0200 |
| commit | 13bb1e954d5bd3cb9a560d9318a8df751e393ccf (patch) | |
| tree | 414b444d9d6fb190c5e1a2258d93cc44d32afd4d /TODO | |
| parent | a7d2b7cf0ffaa0134f65bc0cb3056b8162353517 (diff) | |
Partial implementation of heapRemoveLastWithIndexOnlyRemovesOneElement
Diffstat (limited to 'TODO')
| -rw-r--r-- | TODO | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -5,7 +5,7 @@ This is a rough outline of upcoming tasks: [ ] Prove that CompleteTree.heapUpdateAt returns the element at the given index [ ] Prove that CompleteTree.heapRemoveLastWithIndex and CompleteTree.heapRemoveLast yield the same tree [ ] Prove that CompleteTree.heapRemoveLastWithIndex and CompleteTree.heapRemoveLast yield the same element -[ ] Prove that CompleteTree.heapRemoveLastWithIndex indeed removes the last element +[ ] Prove that CompleteTree.heapRemoveLastWithIndex only removes one element and leaves the rest unchanged - This automatically serves as a proof for CompleteTree.heapRemoveLast, once it is shown that they yield the same tree - A potential approach is to show that any index in the resulting tree can be converted into an index |