Calculating Minimum Edit Distance

Learn the algorithm for finding the minimum edit distance. Implement the minimum edit distance algorithm using dynamic programming.

Introduction

The algorithm for calculating the minimum edit distance can be built using either dynamic programming or recursion. Here, we will consider the dynamic programming version of the algorithm, known as the Wagner-Fischer algorithm. If you are unfamiliar with dynamic programming as a whole, a good overview can be found here, as the basics are outside the scope of this course.

Algorithm walkthrough and pseudocode

Get hands-on with 1400+ tech skills courses.