Add LZW and Arithmetic Coding algorithms in compression category #6803
+85 −0
Add this suggestion to a batch that can be applied as a single commit. This suggestion is invalid because no changes were made to the code. Suggestions cannot be applied while the pull request is closed. Suggestions cannot be applied while viewing a subset of changes. Only one suggestion per line can be applied in a batch. Add this suggestion to a batch that can be applied as a single commit. Applying suggestions on deleted lines is not supported. You must change the existing code in this line in order to create a valid suggestion. Outdated suggestions cannot be applied. This suggestion has been applied or marked resolved. Suggestions cannot be applied from pending reviews. Suggestions cannot be applied on multi-line comments. Suggestions cannot be applied while the pull request is queued to merge. Suggestion cannot be applied right now. Please check back later.
Description
This pull request adds two classic lossless compression algorithms to the compression category:
LZW (Lempel–Ziv–Welch)
Builds a dictionary of strings and replaces repeating patterns with shorter codes.
Example:
Input: TOBEORNOTTOBEORTOBEORNOT
Output: [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]
Arithmetic Coding
Encodes a message as a single number between 0 and 1 using symbol probabilities.
Example:
Input: "BABA" (A:0.5, B:0.5)
Output: 0.34375
Files added:
src/main/java/com/thealgorithms/compression/LZW.java
src/main/java/com/thealgorithms/compression/ArithmeticCoding.java
📚 Related issue: #6798
clang-format -i --style=file path/to/your/file.java