Xref: utzoo comp.lang.c:15402 comp.std.c:665
Path: utzoo!utgpu!watmath!clyde!att!mtunb!jcm
From: jcm@mtunb.ATT.COM (was-John McMillan)
Newsgroups: comp.lang.c,comp.std.c
Subject: Re: BIT Counting: C programming problem
Message-ID: <1368@mtunb.ATT.COM>
Date: 11 Jan 89 17:14:03 GMT
References: <225@tityus.UUCP> <35329@think.UUCP>
Reply-To: jcm@mtunb.UUCP (was-John McMillan)
Organization: AT&T ISL Middletown NJ USA
Lines: 13

In article <35329@think.UUCP> barmar@kulla.think.com.UUCP (Barry Margolin) writes:
>I haven't seen anyone so far suggest the far end of the time/space
>trade-off: have a 64K table, with each element N containing the number
...

Actually, I believe the originating author requested E-Mail of the
suggestions and stated he would summarize the results.  This minimizes
the NetWork traffic and other resource consumption.

And explains why there are probably several suggestions you've missed
-- I hope! ;-)

jc mcmillan	-- att!mtunb!jcm