Cat@ponder.cat to Technology@lemmy.zipEnglish · 1 year 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-square17linkfedilinkarrow-up166arrow-down11cross-posted to: technology@lemmy.world
arrow-up165arrow-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.cat to Technology@lemmy.zipEnglish · 1 year agomessage-square17linkfedilinkcross-posted to: technology@lemmy.world
minus-squareCookieOfFortune@lemmy.worldlinkfedilinkEnglisharrow-up2·1 year agoOnly if there’s no collisions. With lots of collisions it’s far from constant.
Only if there’s no collisions. With lots of collisions it’s far from constant.