I. graphics-action : choose output path, name
II. connect with alg
III. repair alg
LZW INPUT FILE
LZW binary data begijn to be sure that file is encoded using my lzw
save as much data storage as possible
if temp file don't hesitate to focus on speed
lzw temp file will store as well it's number
compress or decompress data and includes:
file explorer (done using graphics.h)
Huffman trees
Lempel-Ziv-Welch algorithm
requirements: at least gcc 17, 32 bit compiler
implementation of the studied data structures
I. graphics-action : choose output path, name
II. connect with alg
III. repair alg
LZW INPUT FILE
LZW binary data begijn to be sure that file is encoded using my lzw
save as much data storage as possible
if temp file don't hesitate to focus on speed
lzw temp file will store as well it's number
compress or decompress data and includes:
file explorer (done using graphics.h)
Huffman trees
Lempel-Ziv-Welch algorithm
requirements: at least gcc 17, 32 bit compiler
implementation of the studied data structures