@adamant-pwn Please someone check this PR!

Wow, this is a significant contribution !Thank you. I'll try to read this soon and give input.

Some of the math @jxu might be good at too in addition to @adamant-pwn.

Briefly, the last expressions are not rendering properly. That might be a spacing issue:

$$O(n + \sum_{i=1}^{n} i \Pr(X_i = 1)) \le O(n + \sum_{i=1}^{n} i \frac{2}{i}) = O(3n) = O(n) \quad \quad \blacksquare $$

Lol it works in GitHub haha.

Given the complexity, it may make sense to add basic tests to our suite.

Personally, I'd prefer proofs to be in one of those drop downs as I'm not as mathematically inclined and am likely to skip over it unless I'm really interested.

It's probably prudent to include the worst case time and scenarios in which they fail expectation.

The math claims will likely require hours to really sit down and verify for me but I'm hoping some of the other guys can chime in.

PS I'm not sure if we've standardized the site as American English or British English spellings ( I noticed practise vs practice.)

Thanks for the useful changes @mhayter !!! I think I fixed the issue with the equation, block equations need to be surrounded by newlines apparently. How could this thing of having a dropdown for the proof be implemented? (EDIT: done!)

The current code does not compile: candidate_closest does not exist.

Also, I'd consider accepting references in the dist function and also changing the name of dis generator as it looks very similar.

Are there any other changes required? @adamant-pwn

Ping :)

Congrats @izanbf1803 and @adamant-pwn !

Thanks @mhayter and @adamant-pwn for helping me improve it! :)