r/ProgrammingLanguages • u/noobypgi0010 • Jul 24 '25
[ Removed by moderator ]
/r/ProgrammingLanguages/comments/1m80sb3/removed_by_moderator/[removed] — view removed post
0
Upvotes
1
u/Anxor_ Jul 24 '25
I can see this working well for smaller hash tables, but I wonder how this fares for larger ones. Linear probing sounds way more cache friendly than funneling down, but at the same time the size is divided each time so it probably fits in cache after a few iterations. We're focusing on worst case, though, so it might not even matter.
0
u/noobypgi0010 Jul 24 '25
I think this approach is more of providing a theoretical better worst time complexity then to be actually used in production as we already have a lot of different hashing algorithms that make hash tables quick.
11
u/TheChief275 Jul 24 '25
Oh no, it’s AI slop