home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.programming
- Path: sparky!uunet!s5!is1.is.morgan.com!is.morgan.com!berlin
- From: berlin@is.morgan.com (Alexander Berlin)
- Subject: Re: finding 1st one in integer
- Message-ID: <1992Jul22.120735@is.morgan.com>
- Sender: news@is.morgan.com
- Nntp-Posting-Host: chico
- Organization: Morgan Stanley - IS
- References: <Brqu3F.1J4@undergrad.math.waterloo.edu> <LOWRY.92Jul21165844@rotor.watson.ibm.com> <BrsMBE.98t@undergrad.math.waterloo.edu> <1992Jul22.152827.14267@cs.cornell.edu>
- Date: Wed, 22 Jul 1992 16:07:35 GMT
- Lines: 13
-
- In article <1992Jul22.152827.14267@cs.cornell.edu>, ressler@cs.cornell.edu (Gene Ressler) writes:
-
- |> ....
- |> benchmark code (chris torek?), this runs about 400% faster than the 37 element
- |> ....
-
- Just a side note: it's impossible to have code that runs 400% faster. Twice
- as fast means 50% faster. 100% faster means in NO TIME.
- 400% slower makes sense, 400% faster doesn't.
- 4 times faster means 75% faster.
- ---
- Alex Berlin
- berlin@is.morgan.com
-