diff options
| author | Andreas Grois <andi@grois.info> | 2024-08-15 20:35:23 +0200 |
|---|---|---|
| committer | Andreas Grois <andi@grois.info> | 2024-08-15 20:35:23 +0200 |
| commit | d9690a03ac14baa0f9c4dc72144438a61f905a78 (patch) | |
| tree | 883680761c49971b41ae8d903643d00e399006af /TODO | |
| parent | 66134227080c17094527f84a3e4a7c59698c5310 (diff) | |
Update TODO
Diffstat (limited to 'TODO')
| -rw-r--r-- | TODO | 4 |
1 files changed, 4 insertions, 0 deletions
@@ -13,6 +13,7 @@ This is a rough outline of upcoming tasks: [x] Prove that CompleteTree.heapUpdateRoot indeed exchanges the value at the root. - Done by showing that the new tree contains all elements except the root, and the updated value. [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. @@ -21,4 +22,7 @@ This is a rough outline of upcoming tasks: [ ] 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. +[ ] Make proofs that currently aren't rigorous rigorous. + - For instance by using element counts instead of just contains. [ ] Write the performance part of this file.
\ No newline at end of file |