Wagner-Fischer (Edit Distance)
The Wagner-Fischer algorithm is a dynamic programming algorithm to determine the (minimum) edit distance between two strings.
The Wagner-Fischer algorithm is a dynamic programming algorithm to determine the (minimum) edit distance between two strings.
Kadane's algorithm solves the maximum-subarray-problem, where the task is finding the contiguous subarray with maximal sum.