#algorithms

Wiki 3

  • Bytecode-to-source mapping Four line-table designs for a bytecode VM, and what the JVM and Lua actually do instead
  • Fast Levenshtein Distance Using a Trie How to find dictionary words within N edits of a query 300× faster by sharing Levenshtein table rows across trie prefixes
  • Unlocking Sudoku's Secrets Chalkdust on two angles on sudoku — vertex coloring with greedy+backtracking, and Gröbner bases via Buchberger's algorithm worked through a shidoku example

Books 1