Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.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: Tue, 07 Apr 2015 16:31:44 +0100
Organization: A noiseless patient Spider
Lines: 22
Message-ID: <87egnwymxr.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>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: mx02.eternal-september.org; posting-host="017616aa25f81ec581c44d76d61ba2f3"; logging-data="7842"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/7gFsdmuM7bVsFeY/RArsCAMhA3D06Sh0="
Cancel-Lock: sha1:aJCQElrv8sC4bCuG1vkT38KBat0= sha1:/HWtipQRbzMuKNAFBYBuFqc3GBU=
X-BSB-Auth: 1.f373328ed76b3e0236b5.20150407163144BST.87egnwymxr.fsf@bsb.me.uk
Xref: csiph.com comp.lang.javascript:27235

jonas.thornvall@gmail.com writes:

> Den tisdag 7 april 2015 kl. 15:23:47 UTC+2 skrev Ben Bacarisse:
>> jonas.thornvall@gmail.com writes:
<snip>
>> > I aim to replace the slow add when dealing with real big bases with a
>> > search.  
>> 
>> I thought your post was about converting between bases.  If it wasn't,
>> just ignore my comments.
>
> It is about converting bases as fast as possible in a general way that
> work for anybase no matter how ***big***. That mean you cannot add up
> digits, it is to slow you have to search the digit, doing a binary
> search or something better.

Then my point stands.  Why are you "searching" for a digit rather than
simply calculating it?  Have you determined that the usual method is too
slow and you have some alternative in mind?

-- 
Ben.