Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!us.feeder.erje.net!feeder.erje.net!eu.feeder.erje.net!newsfeed.fsmpi.rwth-aachen.de!newsfeed.straub-nv.de!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail
From: Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups: comp.lang.javascript
Subject: Re: Best search algorithm to find a condition within a range.
Date: Thu, 09 Apr 2015 17:04:34 +0100
Organization: A noiseless patient Spider
Lines: 15
Message-ID: <871tjt2sq5.fsf@bsb.me.uk>
References: <e82f7f26-569b-4252-a932-12c0819500da@googlegroups.com> <87vbh8yvgv.fsf@bsb.me.uk> <777f7633-724b-442e-864b-d6484c5e87cf@googlegroups.com> <87pp7gysv5.fsf@bsb.me.uk> <2186a589-be06-4453-affc-3c84f9e48379@googlegroups.com> <87egnwymxr.fsf@bsb.me.uk> <2016084.ADp8TKvx9G@PointedEars.de> <f4006c54-269b-4425-91fe-1af684c1cfc8@googlegroups.com> <XnsA475D09719F9Ceejj99@194.109.133.246> <5902185.dpbNY2YNC7@PointedEars.de> <XnsA475E324A1947eejj99@194.109.133.246> <1936096.bgrWbIOXpn@PointedEars.de> <XnsA477904D03C6Aeejj99@194.109.133.246> <mg5ss7$8i5$2@solani.org> <XnsA4779C144C4F4eejj99@194.109.133.246> <f95965d3-4da8-4fc7-9b8e-29377dcf89b6@googlegroups.com> <XnsA477AA5B57105eejj99@194.109.133.246> <6732c49b-03c9-4173-81da-9ee6ab2e48ef@googlegroups.com> <f56ee60a-94ef-4346-8761-3569f04c2de0@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: mx02.eternal-september.org; posting-host="017616aa25f81ec581c44d76d61ba2f3"; logging-data="16162"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/2dsiCSvyRTsiyYgMfeNUDj06WJIqYOeI="
Cancel-Lock: sha1:AM7XxHAxQcCx7ziUUNHSGD18ppo= sha1:pyy8lzdqIV9gIfbixG/2GYSiHT8=
X-BSB-Auth: 1.68bc1a5b2555dd66cccf.20150409170434BST.871tjt2sq5.fsf@bsb.me.uk
Xref: csiph.com comp.lang.javascript:27278

jonas.thornvall@gmail.com writes:
<snip>
> [...] I think this will be the first implementation ever to use
> arithmetic in the base of your choice.

What makes you think that?  I had to do it as a student exercise and I,
in turn sometimes *set* it as an exercise.  I imagine it's been done
hundreds of thousands of times.  When arbitrary-precision arithmetic is
implemented "seriously", the base is usually fixed (at compile time at
least) because for any particular environment there will be a fastest
base, and there is little point in using anything else.

<snip>
-- 
Ben.