Cat@ponder.cat to Technology@lemmy.zipEnglish · 1 month 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-up162arrow-down10cross-posted to: [email protected][email protected]
arrow-up162arrow-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 month agomessage-square17fedilinkcross-posted to: [email protected][email protected]
minus-squareCookieOfFortune@lemmy.worldlinkfedilinkEnglisharrow-up2·1 month 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.