Hi,
The compress function on the mac os, uses an adaptive Lempel-Ziv algorithm. I searched online and I couldn't really find a good summary concerning the function's operation. Does anyone know whether the algorithm compresses files while reading them (like the adaptive huffman coding algorithm) or whether it reads the files once to construct a frequency table and then reads the file once more to compress it (like regular huffman coding)? Also, does anyone know where on the system the c and h files for compress are stored?
Thank you for your help,
BadWolf
The compress function on the mac os, uses an adaptive Lempel-Ziv algorithm. I searched online and I couldn't really find a good summary concerning the function's operation. Does anyone know whether the algorithm compresses files while reading them (like the adaptive huffman coding algorithm) or whether it reads the files once to construct a frequency table and then reads the file once more to compress it (like regular huffman coding)? Also, does anyone know where on the system the c and h files for compress are stored?
Thank you for your help,
BadWolf