I\'m reading The Algorithm Design Manual by Steven Skiena, and I\'m on the dynamic programming chapter. He has some example code for edit distance and uses some functions w
On page 287 in the book:
int match(char c, char d) { if (c == d) return(0); else return(1); } int indel(char c) { return(1); }