I was randomly thinking about loot/drop table implementations in games and naturally started thinking of the fastest way to implement large drop tables.
gpt5 pointed me to this fascinating algorithm ...
it has too high memory cost though, compared to float + binary search
it scales larger than O(n)
it scales larger than O(n)
1