A set of widely-applicable (and fun!) algorithms based mainly on dynamic-programming. (To be augmented)
A set of widely-applicable (and fun!) algorithms based mainly on dynamic-programming. (To be augmented)
(lev-dist a b)Uses dynamic programming to calculate the Levenshtein dist (number of operations) to convert between strings a and b; allowed operations being insertion, deletion and single-character substitution.
Uses dynamic programming to calculate the Levenshtein dist (number of operations) to convert between strings a and b; allowed operations being insertion, deletion and single-character substitution.
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |