@[email protected] to [email protected]English • 3 months 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-up166arrow-down11cross-posted to: [email protected][email protected][email protected][email protected][email protected]
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.org@[email protected] to [email protected]English • 3 months agomessage-square17fedilinkcross-posted to: [email protected][email protected][email protected][email protected][email protected]
minus-squareJackbyDevlinkfedilinkEnglish1•3 months agoI need to look more into this, I would’ve thought query time on hash tables was already constant.
minus-square@[email protected]linkfedilinkEnglish2•3 months agoOnly if there’s no collisions. With lots of collisions it’s far from constant.
I need to look more into this, I would’ve thought query time on hash tables was already constant.
Only if there’s no collisions. With lots of collisions it’s far from constant.