Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on IBM Releases Fully Homomorphic Encryption Toolkit for macOS and iOS. Parent comment
Hash tables and trees are O(1) or O(lg N) which are vastly faster than O(N).
Imagine a database with billions of records. O(N) search on this database will absolutely murder performance.
There are no comments on this comment yet.
Hash tables and trees are O(1) or O(lg N) which are vastly faster than O(N).
Imagine a database with billions of records. O(N) search on this database will absolutely murder performance.