Comment on A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

<- View Parent
frezik@midwest.social ⁨1⁩ ⁨week⁩ ago

Depends on the implementation, but most will, yes. There are other forms of associative arrays, like trie or binary tree, but hash is the most common.

source
Sort:hotnewtop