Re:Ask HN: What are some cool but obscure data structures yo...
by thisisnotatest on Thursday July 28, 2022 @10:02PM
(#32272356)
A helpful little heuristic that always stuck with me from a Stanford lecture by Andrew Ng was, "log N is less than 30 for all N".
[ Parent
| on HN ]
There are no comments on this comment yet.