Path: csiph.com!usenet.pasdenom.info!news.redatomik.org!newsfeed.xs4all.nl!newsfeed4.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.007 X-Spam-Evidence: '*H*': 0.99; '*S*': 0.00; 'from:addr:yahoo.co.uk': 0.04; 'table.': 0.07; '32-bit': 0.09; 'idea?': 0.09; 'lawrence': 0.09; 'lookup': 0.09; 'obsolete': 0.09; 'received:80.91': 0.09; 'received:80.91.229': 0.09; 'received:gmane.org': 0.09; 'received:list': 0.09; 'language.': 0.14; 'add.': 0.16; 'arithmetic.': 0.16; 'chunks': 0.16; 'learnt': 0.16; 'luis': 0.16; 'received:80.91.229.3': 0.16; 'received:plane.gmane.org': 0.16; 'subject:search': 0.16; 'language': 0.16; 'wrote:': 0.18; 'wed,': 0.18; '>>>': 0.22; 'header:User-Agent:1': 0.23; 'header:X -Complaints-To:1': 0.27; 'header:In-Reply-To:1': 0.27; 'bigger': 0.30; 'characters': 0.30; '-0700,': 0.31; '>>>>': 0.31; 'decimal': 0.31; 'operations': 0.35; 'but': 0.35; 'add': 0.35; 'there': 0.35; 'really': 0.36; 'representing': 0.36; 'doing': 0.36; 'turn': 0.37; 'to:addr:python-list': 0.38; 'anything': 0.39; 'to:addr:python.org': 0.39; 'received:org': 0.40; 'expression': 0.60; 'most': 0.60; 'new': 0.61; 'numbers': 0.61; 'simply': 0.61; 'email addr:gmail.com': 0.63; 'happen': 0.63; 'our': 0.64; 'sum': 0.64; 'charset:windows-1252': 0.65; 'within': 0.65; 'bottom': 0.67; 'hand': 0.80; '2015': 0.84; 'choices.': 0.84; 'subject:find': 0.84; 'subject:Best': 0.91 X-Injected-Via-Gmane: http://gmane.org/ To: python-list@python.org From: Mark Lawrence Subject: Re: Best search algorithm to find condition within a range Date: Wed, 08 Apr 2015 21:28:00 +0100 References: <2e3a3c01-20b3-4948-9b32-bd80ed46822b@googlegroups.com> <9fd13f49-8bfa-43ef-8787-21d5c76a6268@googlegroups.com> <55247896$0$12995$c3e8da3$5496439d@news.astraweb.com> <5b12545a-fcc5-4791-a55d-dcf82880416d@googlegroups.com> <5de8eb89-38c6-4b1d-9be3-d74aa4968510@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain; charset=windows-1252; format=flowed Content-Transfer-Encoding: 7bit X-Gmane-NNTP-Posting-Host: host-78-147-186-84.as13285.net User-Agent: Mozilla/5.0 (Windows NT 6.3; WOW64; rv:31.0) Gecko/20100101 Thunderbird/31.6.0 In-Reply-To: <5de8eb89-38c6-4b1d-9be3-d74aa4968510@googlegroups.com> X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.20 Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 30 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1428524900 news.xs4all.nl 2869 [2001:888:2000:d::a6]:36070 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:88683 On 08/04/2015 20:36, jonas.thornvall@gmail.com wrote: > Den onsdag 8 april 2015 kl. 21:28:34 UTC+2 skrev jonas.t...@gmail.com: >> Den onsdag 8 april 2015 kl. 19:34:39 UTC+2 skrev Mel Wilson: >>> On Wed, 08 Apr 2015 07:56:05 -0700, jonas.thornvall wrote: >>> >>>> There is no need for inventing a new set of characters representing >>>> 32-bit numbers. You will not be able to learn them by heart anyway, >>>> unless they build on a interpretation system binaries, decimals. >>> >>> See Jorge Luis Borges, _Funes the Memorious_. Gotta keep up with the >>> literature. >> >> One thing is true though the bigger the chunks the less operations doing add. >> So arithmetic may turn out to be obsolete and replaced with search in lookuptables. > > When doing by hand and working within the digitspace of a single decimal digit like 3+4 the operation is implicit. You do not really add anything you use a lookup table. > > But if you take an expression like 193+169, most people perform the arithmetic. Unless they do not happen to be your favourit numbers and you learnt the sum by heart. > > Top down or bottom up is basicly the choices. > Are you trolling or do you simply not have the faintest idea? -- My fellow Pythonistas, ask not what our language can do for you, ask what you can do for our language. Mark Lawrence