diff options
| author | Andreas Grois <andi@grois.info> | 2024-08-19 22:45:41 +0200 |
|---|---|---|
| committer | Andreas Grois <andi@grois.info> | 2024-08-19 22:45:41 +0200 |
| commit | 7d5df252a6e885f8b1ffab49196e0a4cc4b0131a (patch) | |
| tree | 85dc147fcd886ae169b7b82f65824f1fce7a7b05 /TODO | |
| parent | c52a36a1ae9bb5e661a4c689a05d8ebcefcc704c (diff) | |
heapUpdateAtOnlyUpdatesAt
Diffstat (limited to 'TODO')
| -rw-r--r-- | TODO | 8 |
1 files changed, 4 insertions, 4 deletions
@@ -15,14 +15,14 @@ This is a rough outline of upcoming tasks: [x] Prove that heapPop leaves all values in the tree, except the root. - Current proof is not rigorous. Needs more work in the future. [x] Prove that heapPop returns the root -[ ] Prove that CompleteTree.heapUpdateAt returns the element at the given index -[ ] Prove that CompleteTree.heapUpdateAt indeed updates the value at the given index. +[x] Prove that CompleteTree.heapUpdateAt returns the element at the given index +[x] Prove that CompleteTree.heapUpdateAt indeed updates the value at the given index. - Use the same approach as heapUpdateRoot [ ] Prove that CompleteTree.heapRemoveAt returns the element at the given index [ ] Prove that CompleteTree.heapRemoveAt leaves all values in the tree except at the input index. -Stuff below is not scheduled to happen any time soon. +Stuff below is not scheduled to happen any time soon. Feel free to contribute though. [ ] Make proofs that currently aren't rigorous rigorous. - - For instance by using element counts instead of just contains. + - For instance by using element counts instead of contains. [ ] Write the performance part of this file.
\ No newline at end of file |