Path: csiph.com!usenet.pasdenom.info!weretis.net!feeder4.news.weretis.net!feeds.phibee-telecom.net!newsfeed.xs4all.nl!newsfeed4.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail
Return-Path: <ian.g.kelly@gmail.com>
X-Original-To: python-list@python.org
Delivered-To: python-list@mail.python.org
X-Spam-Status: OK 0.022
X-Spam-Evidence: '*H*': 0.96; '*S*': 0.00; 'subject:not': 0.03; 'algorithm': 0.04; 'heavily': 0.04; 'anyway.': 0.05; 'tree': 0.05; 'subject:Python': 0.06; '1000.': 0.09; 'optimizing': 0.09; 'trees': 0.09; 'dfs': 0.16; 'iteratively': 0.16; 'sat,': 0.16; 'wrote:': 0.18; 'memory': 0.22; 'balancing': 0.24; 'planet': 0.24; 'nearly': 0.26; 'header:In-Reply-To:1': 0.27; 'point': 0.28; 'am,': 0.29; 'message-id:@mail.gmail.com': 0.30; 'getting': 0.31; 'depth': 0.31; 'search.': 0.31; 'probably': 0.32; 'device': 0.34; 'could': 0.34; 'received:google.com': 0.35; 'really': 0.36; 'should': 0.36; 'implement': 0.38; 'to:addr:python-list': 0.38; 'list,': 0.38; 'rather': 0.38; 'to:addr:python.org': 0.39; 'enough': 0.39; 'is.': 0.60; 'truly': 0.60; 'balance': 0.61; 'entire': 0.61; "you'll": 0.62; 'kind': 0.63; 'such': 0.63; 'relatively': 0.65; 'dont': 0.67; 'search,': 0.74; '2015': 0.84; 'balanced': 0.84; 'harness': 0.84; 'irrelevant': 0.84; 'optimisation': 0.84; 'thing,': 0.91
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:from:date:message-id:subject:to :content-type; bh=L1O7LEsMaCSeAFN2i4Vkf8A9MYCS1QBh2HLH9q/daqc=; b=bM2JOKKeJ1gOOmEnplTkeNbipCQ/kH++AjXNoblbq07INMwA2azgPzFRj+CybNoZs6 W6gU4BVIAqruIUtbdDZ9cFfBfNG27mWn5iTN0TMcfie0qdYH/TmodWl6RF/gKzQpmLlp Zp+oyNCfo+4033Vbs7UseGI0uywMNBLVD3EBd11HZiCbif3pv19ut1RclOuQFS9ZzYfK d0Xtxms7QS+k8dkwCmXcPjAmV1RVtzMrYCgzKbMOoBDkIG/cGXX+/TzpcjY3vhNUZhrF jtIHPeM3wRz5JtNBeYq74W7Yv7VDrEXGPYU1nxjFnV1nI8cNVWA2CpIt2QgOJJNBy7Uv CESw==
X-Received: by 10.43.64.144 with SMTP id xi16mr21074342icb.20.1430587077919; Sat, 02 May 2015 10:17:57 -0700 (PDT)
MIME-Version: 1.0
In-Reply-To: <CAB1GNpRRL8qwA+Oy7EgNb_5myYdBgo6triAB_550YgvvUaC2+A@mail.gmail.com>
References: <87mw1q9jqw.fsf@Equus.decebal.nl> <mailman.121.1430385051.3680.python-list@python.org> <87383hj4zj.fsf@elektro.pacujo.net> <87d22lx38x.fsf@Equus.decebal.nl> <55432557$0$12994$c3e8da3$5496439d@news.astraweb.com> <87383fo062.fsf@Equus.decebal.nl> <87egmzl4yr.fsf@elektro.pacujo.net> <mailman.4.1430558719.12865.python-list@python.org> <87a8xnl2r6.fsf@elektro.pacujo.net> <mi2b49$pip$1@dont-email.me> <mailman.9.1430565706.12865.python-list@python.org> <mi2cjc$uq2$1@dont-email.me> <87383fkxy0.fsf@elektro.pacujo.net> <CALwzidn_4EyKA-AekPqwk2+1+0Yd3ONsTdKx73bfpzZkyXj++w@mail.gmail.com> <CAB1GNpRRL8qwA+Oy7EgNb_5myYdBgo6triAB_550YgvvUaC2+A@mail.gmail.com>
From: Ian Kelly <ian.g.kelly@gmail.com>
Date: Sat, 2 May 2015 11:17:17 -0600
Subject: Re: Python is not bad ;-)
To: Python <python-list@python.org>
Content-Type: text/plain; charset=UTF-8
X-BeenThere: python-list@python.org
X-Mailman-Version: 2.1.20+
Precedence: list
List-Id: General discussion list for the Python programming language <python-list.python.org>
List-Unsubscribe: <https://mail.python.org/mailman/options/python-list>, <mailto:python-list-request@python.org?subject=unsubscribe>
List-Archive: <http://mail.python.org/pipermail/python-list/>
List-Post: <mailto:python-list@python.org>
List-Help: <mailto:python-list-request@python.org?subject=help>
List-Subscribe: <https://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe>
Newsgroups: comp.lang.python
Message-ID: <mailman.20.1430587080.12865.python-list@python.org>
Lines: 26
NNTP-Posting-Host: 2001:888:2000:d::a6
X-Trace: 1430587080 news.xs4all.nl 2925 [2001:888:2000:d::a6]:41392
X-Complaints-To: abuse@xs4all.nl
Xref: csiph.com comp.lang.python:89783

On Sat, May 2, 2015 at 9:53 AM, Joonas Liik <liik.joonas@gmail.com> wrote:

Top-posting is heavily frowned at on this list, so please don't do it.

> Balancing of trees is kind of irrelevant when "tree" means "search space"
> no?

I think it's relatively rare that DFS is truly the best algorithm for
such a search. For one thing, "search space" often means "graph", not
"tree". And for any other type of search, you'll want/need to
implement it iteratively rather than recursively anyway.

> And you definitely dont need to keep the entire tree in memory at the same
> time.

You could harness every single storage device on the planet and you
would still not have nearly enough capacity to fill a balanced search
tree to a depth of 1000.

> Also should not-running-out-of-call-stack really be the main reason to
> balance trees?
> That sounds like an optimisation to me ..

It is. My point was that if your unbalanced search tree is getting to
a depth of 1000, then it's probably long past time for you to start
thinking about optimizing it *anyway*.