Cat@ponder.cat to Technology@lemmy.zipEnglish · 1 day 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-square17fedilinkarrow-up161arrow-down11cross-posted to: [email protected]
arrow-up160arrow-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 day agomessage-square17fedilinkcross-posted to: [email protected]
minus-squareCookieOfFortune@lemmy.worldlinkfedilinkEnglisharrow-up1·7 hours 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.