home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #20 / NN_1992_20.iso / spool / comp / sys / mac / programm / 15033 < prev    next >
Encoding:
Internet Message Format  |  1992-09-07  |  986 b 
  1. Path: sparky!uunet!crdgw1!rpi!usc!cs.utexas.edu!sun-barr!ames!data.nas.nasa.gov!taligent!apple!mumbo.apple.com!gallant.apple.com!wintermute.apple.com!user
  2. From: ksand@apple.com (Kent Sandvik)
  3. Newsgroups: comp.sys.mac.programmer
  4. Subject: Re: Best text compression?
  5. Message-ID: <ksand-040992183535@wintermute.apple.com>
  6. Date: 5 Sep 92 01:42:30 GMT
  7. References: <1992Sep3.214518.9599@mnemosyne.cs.du.edu> <71986@apple.Apple.COM>
  8. Sender: news@gallant.apple.com
  9. Followup-To: comp.sys.mac.programmer
  10. Organization: Apple
  11. Lines: 12
  12.  
  13. In article <71986@apple.Apple.COM>, anderson@Apple.COM (Clark Anderson)
  14. wrote:
  15. > I have gotten pretty good compression on text using
  16. > a Huffman algorithm. It's pretty easy to implement,
  17. > any standard book on compression schemes should
  18. > have it.
  19.  
  20. For instance the new "Algorithsm in C++" by Sedgewick has a code
  21. snippet showing how it's done. Seems more and more authors are making
  22. big bucks on rewriting their books with "C++" in the title.
  23.  
  24. Kent Sandvik/DTS
  25.