HN is great. There are so many fun algorithms listed here. My favorites are already mentioned but a few important ones are missing: Boyer-Moore fast substring

HN is great. There are so many fun algorithms listed here. My favorites are already mentioned but a few important ones are missing: Boyer-Moore fast substring searching. Simple to understand and has great performance. [1] Alpha-Beta game tree search. I really like Knuth’s paper on it. [2] [1] https://en.m.wikipedia.org/wiki/Boyer–Moore_string-search_algorithm https://en.m.wikipedia.org/wiki/Boyer–Moore_string-search_al... [2] Artificial Intelligence Volume 6, Issue 4, Winter 1975, Pages 293-326