diff --git a/README.md b/README.md
index f19d258..ad386f1 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 its scheme includes sorting numerical values from a set in the 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.