News for hackers. Stuff that matters.
Re:Why databases use ordered indexes but programming uses ha... by lostmsu on Monday December 09, 2019 @07:35PM (#21748396)
Same applies to trees thought: you have to multiply log n by that bit number, because each naive comparison will take O(bit number)

There are no comments on this comment yet.