Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!newsfeed.xs4all.nl!newsfeed6.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail
Return-Path: <python-python-list@m.gmane.org>
X-Original-To: python-list@python.org
Delivered-To: python-list@mail.python.org
X-Spam-Status: OK 0.002
X-Spam-Evidence: '*H*': 1.00; '*S*': 0.00; 'python.': 0.02; 'subject:Python': 0.05; 'python': 0.09; 'lookup': 0.09; 'received:80.91': 0.09; 'received:80.91.229': 0.09; 'received:gmane.org': 0.09; 'received:list': 0.09; 'sep': 0.09; 'subject:using': 0.09; 'elements,': 0.16; 'foundational': 0.16; 'hashed': 0.16; 'received:80.91.229.3': 0.16; 'received:plane.gmane.org': 0.16; 'element': 0.17; 'python?': 0.20; 'focusing': 0.22; 'header:X-Complaints-To:1': 0.28; 'probably': 0.29; 'fri,': 0.30; 'lists': 0.31; '(and': 0.32; 'implement': 0.32; 'shift': 0.33; 'url:home': 0.33; 'to:addr :python-list': 0.33; 'subject:?': 0.35; "won't": 0.35; 'there': 0.35; 'received:org': 0.36; 'but': 0.36; 'depends': 0.36; 'charset :us-ascii': 0.36; 'subject:: ': 0.38; 'mean': 0.38; 'to:addr:python.org': 0.39; 'skip:" 10': 0.40; 'header:Received:5': 0.40; 'your': 0.60; 'become': 0.65; '"remove"': 0.81; 'textbook': 0.84; 'dennis': 0.91; 'received:108': 0.91
X-Injected-Via-Gmane: http://gmane.org/
To: python-list@python.org
From: Dennis Lee Bieber <wlfraed@ix.netcom.com>
Subject: Re: Algorithms using Python?
Date: Fri, 21 Sep 2012 15:45:44 -0400
Organization: > Bestiaria Support Staff <
References: <TYV6s.7304$Vh6.4862@newsfe20.iad>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Gmane-NNTP-Posting-Host: adsl-108-79-219-15.dsl.klmzmi.sbcglobal.net
X-Newsreader: Forte Agent 3.3/32.846
X-No-Archive: YES
X-BeenThere: python-list@python.org
X-Mailman-Version: 2.1.15
Precedence: list
List-Id: General discussion list for the Python programming language <python-list.python.org>
List-Unsubscribe: <http://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: <http://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe>
Newsgroups: comp.lang.python
Message-ID: <mailman.1028.1348256749.27098.python-list@python.org>
Lines: 20
NNTP-Posting-Host: 2001:888:2000:d::a6
X-Trace: 1348256749 news.xs4all.nl 6969 [2001:888:2000:d::a6]:56781
X-Complaints-To: abuse@xs4all.nl
Xref: csiph.com comp.lang.python:29663

On Fri, 21 Sep 2012 14:26:04 +0530, Mayuresh Kathe <mayuresh@kathe.in>
declaimed the following in gmane.comp.python.general:

> Is there a good book on foundational as well as advanced algorithms 
> using Python?
>
	Depends on what you mean by "foundational"...

	Since Python has dynamic lists and dictionaries, I suspect you won't
find any textbook focusing on linked-list or hashed lookup algorithms
using Python.

	You can probably implement them, but they're not going to be very
efficient. (And never "remove" an element from the linked-list
implementation because Python would shift all the other elements, hence
your "links" become invalid).
-- 
	Wulfraed                 Dennis Lee Bieber         AF6VN
        wlfraed@ix.netcom.com    HTTP://wlfraed.home.netcom.com/