Xref: utzoo comp.lang.c:15411 comp.std.c:667
Path: utzoo!utgpu!watmath!clyde!att!ucbvax!agate!bionet!apple!desnoyer
From: desnoyer@Apple.COM (Peter Desnoyers)
Newsgroups: comp.lang.c,comp.std.c
Subject: Re: BIT Counting: C programming problem
Message-ID: <23783@apple.Apple.COM>
Date: 11 Jan 89 23:36:59 GMT
References: <225@tityus.UUCP> <35329@think.UUCP> <1368@mtunb.ATT.COM>
Organization: Apple Computer Inc, Cupertino, CA
Lines: 12

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
>...

Note that if disk transfer speed is 1MByte/sec (counting seeks), this
will add 64mS to the total program execution time. If you save 1uS per
call with this table, you need to use the function 64000 times just to
break even. Moral - huge lookup tables are not free - you have to load
them in before you start. (unless you are running from rom :-)

				Peter Desnoyers