It depends a bit on exactly what you mean. But eg if you want to write a new hash table (with a new hash function), you'd want to do pretty similar-ish analysi

It depends a bit on exactly what you mean. But eg if you want to write a new hash table (with a new hash function), you'd want to do pretty similar-ish analysis to figure out whether it's a good idea. I used some neat math in my time to justify much simpler algorithms than what we were using before. (But not hash table related.) https://www.keithschwarz.com/darts-dice-coins/ https://www.keithschwarz.com/darts-dice-coins/ is also a joy to read. (As mentioned in the discussion on https://news.ycombinator.com/item?id=8006336 https://news.ycombinator.com/item?id=8006336 ) Have a look at eg https://www.eecs.harvard.edu/~michaelm/postscripts/handbook2001.pdf https://www.eecs.harvard.edu/~michaelm/postscripts/handbook2... for some more in this flavour.