Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!hp4nl!star.cs.vu.nl!jms
From: jms@cs.vu.nl (Jan-Mark)
Newsgroups: comp.os.minix
Subject: Re: compress and comic
Message-ID: <7221@star.cs.vu.nl>
Date: 2 Aug 90 21:48:17 GMT
References: <26407@nigel.udel.EDU> <2026@ns-mx.uiowa.edu>
Sender: news@cs.vu.nl
Reply-To: jms@cs.vu.nl (Wams Jan Mark)
Organization: VU Dept. of Computer Science, Amsterdam, The Netherlands
Lines: 13

In an article williams@umaxc.weeg.uiowa.edu (Kent Williams) writes:

> Comic is way too slow for everyday use.  As near as I can tell it uses
> an O(n*m) algorithm, where n is a function of the input size, and m is
> the string table size.  Try comic-ing a >100K tar some time!

Question: Where you talking about COMIC 1.0 or 1.0B?

--

				 (:>	jms
				(_)
			========""======