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
deegeese@sopuli.xyz ⁨2⁩ ⁨months⁩ ago

If you use a hash table, you search every time you retrieve an object.

If you didn’t retrieve, why would you be storing the data in the first place?

source
Sort:hotnewtop