From beb4ab684059b876d4f684023d536021f92e6056 Mon Sep 17 00:00:00 2001
From: $iD <32844499+sidcodestacks@users.noreply.github.com>
Date: Sat, 24 Oct 2020 15:37:39 +0530
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index f19d258..525b085 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +1,3 @@
 # Huffman Coding 
 
-Huffman coding is a lossless data encoding algorithm. The process behind its scheme includes sorting numerical values from a set in order of their frequency. The least frequent numbers are gradually eliminated via the Huffman tree, which adds the two lowest frequencies from the sorted list in every new “branch.” The sum is then positioned above the two eliminated lower frequency values, and replaces them in the new sorted list.
+Huffman coding is a lossless data encoding algorithm. The process behind the scheme includes sorting numerical values from a set in order of their frequency. The least frequent numbers are gradually eliminated via the Huffman tree, which adds the two lowest frequencies from the sorted list in every new “branch.” The sum is then positioned above the two eliminated lower frequency values, and replaces them in the new sorted list.