Formally Prove Worst Cases Complexities of K-Ary Sum Trees #85
Open
Description
Implementation Spec: /issues/62
Implementation Code: https://github.com/kleros/kleros/blob/master/contracts/data-structures/KArySumTreeFactory.sol
Two proofs are needed:
- Worst case drawing complexity is
O(K * log(n)/log(K)). - Worst case append complexity is
O(log(n)/log(K)).