My purpose was mainly educational. I think that in the future I'll continue to use programs like winzip or gzip to compress data on my hard disk. Nevertheless I'm curious to know which is the best approach in J for such algorithms (sequential machine like in the Huffman Code Essay, power adverb, or just prefix adverb, or something else...). My feeling is that J performance could be very good in data compression (even if I'm not able to write the best program).
Lorenzo Tomei -- View this message in context: http://www.nabble.com/data-compression-algorithms-tp20609301s24193p20616148.html Sent from the J Programming mailing list archive at Nabble.com. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
