IT · 2026-10-24 05:45
The author compares an AVL tree with a disk-based array at a scale of two billion nodes, showing the disk approach uses only 264MiB of memory yet is faster overall, highlighting the limits of Big O simplification and the bandwidth advantages of NVMe.
Auto-generated summary for reference only. RSS