BIT Counting: C programming problem

[was-John McMillan]

In article <35329 at think.UUCP> barmar at 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