From 74a367545454d7de3d6f9f4da9810f1050564d9b Mon Sep 17 00:00:00 2001 From: Ali Nasser <77440596+ali-mohamed-nasser@users.noreply.github.com> Date: Tue, 19 Jan 2021 01:09:25 +0200 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 6d412c9..971b385 100644 --- a/README.md +++ b/README.md @@ -27,7 +27,7 @@ The LZW algorithm is a very common compression technique. This algorithm is typi The main idea behind this algorithm is that it looks for repeated patterns of data (character sequence, bit sequences, etc), and replaces the pattern with a code (in case of images, it will replace that pattern with a value between 0 and 255). A dictionary holds the mapping between a data sequence and a corresponding code, so when a pattern is seen later in the data, we can check to see if it has been encountered already, and if so, replace it with the corresponding code from the dictionary. ### Compression Example -- The input string ```BABAABAAA```. +- The input string ```BABAABAAA``` - The steps involved are systematically shown in the diagram below.