From d6c9fde590ae73b43981165be4629fb1ba96ad03 Mon Sep 17 00:00:00 2001
From: Kevin <65783003+kewarrie@users.noreply.github.com>
Date: Sun, 28 Jan 2024 20:43:37 +0300
Subject: [PATCH] Updated README.md

---
 README.md | 14 +++++++++++++-
 1 file changed, 13 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 098b866..edce864 100644
--- a/README.md
+++ b/README.md
@@ -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).