The Best Way to Do Randomized Algorithms in Computer Science

This is a very common garithmic design in theoretical computer science to do so called randomized algorithms that have good amortized run time. It's not, it looks like a hack, but it turns out it's the best thing we have. Ah, and y, splunky adjacent a. Otkno, you aven't payed a lot, but i feel li id. I'd love to at least hear your initial impressions of noita. We got questions from matron boy, jf w gallant and tripmo. All want to hear a little bit of Noita.