minus-squareCookieOfFortune@lemmy.worldtoTechnology@lemmy.zip•A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.linkfedilinkEnglisharrow-up2·4 hours agoOnly if there’s no collisions. With lots of collisions it’s far from constant. linkfedilink
Only if there’s no collisions. With lots of collisions it’s far from constant.