News for hackers. Stuff that matters.
Re:B-Trees Require Fewer Comparisons Than Balanced Binary Se... by kristopolous on Monday June 24, 2024 @03:39AM (#40773416)
Honestly for me it's either linear search, dictionary, or external store like database and that's actually it.

I think I've had to implement my own traversable data structure literally only in interviews

Re:B-Trees Require Fewer Comparisons Than Balanced Binary Se... by saghm on Monday June 24, 2024 @01:07PM (#40778470)
To clarify, I definitely don't mean I've been implementing these structures by hand! Even when using data structures from the standard library or other dependencies though, I just don't end up needing sort-ordered collections very often in my work, and I thought that was interesting (although sibling comments might indicate that this isn't necessarily typical).