Skip to content

Commit

Permalink
Updated README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
kewarrie committed Jan 28, 2024
1 parent 0aced04 commit d6c9fde
Showing 1 changed file with 13 additions and 1 deletion.
14 changes: 13 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -1,5 +1,17 @@
# Wanger-Fischer Algorithm

The [Wagner-Fischer](https://en.wikipedia.org/wiki/Wagner%E2%80%93Fischer_algorithm) algorithm is a dynamic programming algorithm that calculates the Levenshtein distance between two strings of characters.
The [Wagner-Fischer](https://en.wikipedia.org/wiki/Wagner%E2%80%93Fischer_algorithm) algorithm is a dynamic programming algorithm that calculates the Levenshtein distance between two strings of characters.

### How to run the code

1. Clone this repository to your local drive.
2. Install Python3 (& pip).
3. Run the following command to see the results:

```
python3 wagner-fischer.py
```

### Credits

Algorithm by [boo1](https://github.com/b001io) on [YouTube](https://www.youtube.com/watch?v=d-Eq6x1yssU).

0 comments on commit d6c9fde

Please sign in to comment.