| commit | 18c11763e111ba4a580e3c4fd840c07a8f8b2112 | |
| author | Eric Blake <eblake@redhat.com> | |
| Tue, 24 Jan 2023 02:00:21 +0000 (23 20:00 -0600) | ||
| committer | Eric Blake <eblake@redhat.com> | |
| Tue, 24 Jan 2023 02:01:03 +0000 (23 20:01 -0600) | ||
| tree | 6d5907db5c24ef2ebe1c76a3cb9f6e4b245250bd | treesnapshot (tar.gz zip) |
| parent | 3ad009ae85b47fe1231111610a8c127f2cd73039 | commitdiff |
day 20 track WAVL effort by size updates
Works out to about 1.6 million updates to a node's size, in line with
my estimates for about 12 updates per insert and per delete where the
binary tree of 5000 elements has about 12 levels. Proves that the
algorithm really is O(n log n), even though it has more overhead at
when n=5000 than the O(n sqrt n) implementation.
Works out to about 1.6 million updates to a node's size, in line with
my estimates for about 12 updates per insert and per delete where the
binary tree of 5000 elements has about 12 levels. Proves that the
algorithm really is O(n log n), even though it has more overhead at
when n=5000 than the O(n sqrt n) implementation.
| 2022/day20.m4 | diffblobblamehistory |