Knowledge base
🍿 CS Algorithms
Notes filed under 🍿 CS Algorithms.
Notes in this folder
🍿 CS Algorithms
KMP algorithm for sub-sequence-search
KMP (Knuth-Morris-Pratt) matches a pattern inside a longer text in linear time by reusing the longest proper prefix-suffix overlap, so the scan never backtracks. Here it locates a section's exact line range inside a long note, which is what Equation Citator needs for embedded previews.
🍿 CS Algorithms
Best-first, A-star and Beam Search
Best-first, A* and beam search are the three practical ways to steer a search with a heuristic. Use them for path finding, planning and sequence decoding - A-star when an admissible heuristic is available, beam search when the frontier must stay small.