Path: csiph.com!usenet.pasdenom.info!weretis.net!feeder4.news.weretis.net!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail From: Ben Bacarisse Newsgroups: comp.lang.javascript Subject: Re: Time complexity and division Date: Sun, 21 Jun 2015 12:35:49 +0100 Organization: A noiseless patient Spider Lines: 18 Message-ID: <871th5l2ei.fsf@bsb.me.uk> References: <966326c6-971f-469c-b4de-885c9c2233ac@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: mx02.eternal-september.org; posting-host="017616aa25f81ec581c44d76d61ba2f3"; logging-data="21101"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+/RilUqQPjSdj08+82FUlU2qywxVZ7oa8=" Cancel-Lock: sha1:K2pzO6AYAbLxNnMn3iFcRQPIao4= sha1:yoGqoTiw7SvEsnvjbPowJ9/2bqg= X-BSB-Auth: 1.69ef5f91fea7771cd6b1.20150621123549BST.871th5l2ei.fsf@bsb.me.uk Xref: csiph.com comp.lang.javascript:28126 jonas.thornvall@gmail.com writes: > Does anyone know the time complexity of my suggested min max search > operation vs a schoolbook long division, sieve of Erathostenes or > Karatsuba? I don't know what your "min max search operation" is and I'm puzzled by the fact you want to compare is with three apparently different things (a division algorithm, a mother of finding primes and a multiplication algorithm). > Is there any other name for it than min max search? I *think* it's what everyone else calls a binary search, but you don't show it so that's just guessing. -- Ben.