3 ms·

Fun list! Other things I'd recommend trying: Huffman coding Binary decision diagrams Simplex method General modeling of a problem to SAT The

by taeric 4y ago

Fun list! Other things I'd recommend trying: Huffman coding Binary decision diagrams Simplex method General modeling of a problem to SAT The last one there is particularly fun. Finding a way to solve a problem fast by mapping it to a silly large set of variables is surprisingly fun.

pfdietz 4y ago
Suffix trees
- evouga 4y ago
  Yes! Most of the examples of “challenging” algorithms in the blog post are actually fairly elementary stuff covered in undergrad algorithms. Suffix arrays though (especially linear-time construction) are the real deal.