Cat@ponder.catdeleted by creator to Technology@lemmy.worldEnglish · 2 years agoA young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.www.quantamagazine.orgexternal-linkmessage-square50linkfedilinkarrow-up1370arrow-down118
arrow-up1352arrow-down1external-linkA young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.www.quantamagazine.orgCat@ponder.catdeleted by creator to Technology@lemmy.worldEnglish · 2 years agomessage-square50linkfedilink
minus-squarefrezik@midwest.sociallinkfedilinkEnglisharrow-up5·2 years agoDepends 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.
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.