Status: IN
Four systems use algorithmically sub-optimal implementations — linear prefix scan, key-by-key Merkle diff, full re-sort on insertion, linear purge on unfollow — where O(log n) alternatives exist, prioritizing implementation clarity over asymptotic efficiency at the pedagogical scale these modules target.
Consistent choice of simple O(n) over optimal O(log n) across unrelated modules indicates a deliberate pedagogical convention
Depends on (SL): geohash-nearby-prefix-scan-is-linear, kv-merkle-tree-brute-force-diff, stock-exchange-price-sort-is-full-resort, news-feed-unfollow-purges-via-linear-scan