Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!newsfeed.xs4all.nl!newsfeed5.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.002 X-Spam-Evidence: '*H*': 1.00; '*S*': 0.00; 'python.': 0.02; 'subject:Python': 0.05; 'python': 0.09; 'literal': 0.09; 'lookup': 0.09; 'sep': 0.09; 'subject:using': 0.09; 'url:mit': 0.09; "wouldn't": 0.11; 'suggest': 0.11; 'classes:': 0.16; 'dictionaries': 0.16; 'elements,': 0.16; 'filename:fname piece:signature': 0.16; 'foundational': 0.16; 'hashed': 0.16; 'stuff.': 0.16; 'url:electrical-engineering-and-computer-science': 0.16; 'url:ocw': 0.16; 'wrote:': 0.17; 'byte': 0.17; 'element': 0.17; 'url:edu': 0.18; 'mostly': 0.20; 'python?': 0.20; 'java': 0.21; 'focusing': 0.22; 'libraries': 0.22; "i'd": 0.22; 'thus': 0.24; 'header:In-Reply-To:1': 0.25; 'header:User-Agent:1': 0.26; 'c++': 0.27; 'structures': 0.27; 'probably': 0.29; 'books': 0.30; 'fri,': 0.30; 'lists': 0.31; '(and': 0.32; 'implement': 0.32; 'shift': 0.33; 'problem': 0.33; 'to:addr:python-list': 0.33; 'solving': 0.35; 'pm,': 0.35; 'subject:?': 0.35; "won't": 0.35; 'there': 0.35; 'but': 0.36; 'depends': 0.36; "didn't": 0.36; 'anything': 0.36; 'data': 0.37; 'subject:: ': 0.38; 'mean': 0.38; 'science': 0.38; 'to:addr:python.org': 0.39; 'skip:" 10': 0.40; 'your': 0.60; 'easy': 0.60; 'john': 0.60; 'introduction': 0.62; 'become': 0.65; 'talking': 0.66; 'miller': 0.69; 'offer.': 0.78; '"remove"': 0.81; '6.000': 0.84; 'huh?': 0.84; 'textbook': 0.84; 'dennis': 0.91 Date: Fri, 21 Sep 2012 15:43:53 -0500 From: Evan Driscoll User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:10.0.6esrpre) Gecko/20120714 Thunderbird/10.0.6 MIME-Version: 1.0 To: python-list@python.org Subject: Re: Re: Algorithms using Python? References: In-Reply-To: X-Enigmail-Version: 1.4 Content-Type: multipart/signed; micalg=pgp-sha1; protocol="application/pgp-signature"; boundary="------------enig564913963B569E4B290B46AF" X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.15 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: 78 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1348260279 news.xs4all.nl 6864 [2001:888:2000:d::a6]:55124 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:29680 This is an OpenPGP/MIME signed message (RFC 2440 and 3156) --------------enig564913963B569E4B290B46AF Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable On 09/21/2012 02:45 PM, Dennis Lee Bieber wrote: > On Fri, 21 Sep 2012 14:26:04 +0530, Mayuresh Kathe > declaimed the following in gmane.comp.python.general: >=20 >> Is there a good book on foundational as well as advanced algorithms=20 >> using Python? >> > Depends on what you mean by "foundational"... >=20 > 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. I wouldn't be so sure; C++ and Java both have standard libraries with dictionaries (and thus are mostly lacking a literal syntax). But it's easy to find books talking about the simple stuff. I'd suggest looking at the books used in MIT's intro classes: 6.000 (Intro to CS and programming): http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-= 00sc-introduction-to-computer-science-and-programming-spring-2011/Syllabu= s/ Zelle, John M. Python Programming: An Introduction to Computer Science Budd, Timothy. Exploring Python Shaw, Zed A. Learn Python the Hard Way [online] Swaroop, CH. A Byte of Python 6.006 (Intro to algorithms): http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-= 006-introduction-to-algorithms-spring-2008/syllabus/ Miller and Ranum. Problem Solving with Algorithms and Data Structures Using Python. [CLRS isn't Python] and see if they have anything to offer. (I didn't actually look.) > 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). Huh? Evan --------------enig564913963B569E4B290B46AF Content-Type: application/pgp-signature; name="signature.asc" Content-Description: OpenPGP digital signature Content-Disposition: attachment; filename="signature.asc" -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.14 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iQEcBAEBAgAGBQJQXNGPAAoJEAOzoR8eZTzgGdAH/Rm9KojUB8W52JFrtQ8ngurh yb6aQUd01rGzcDbBpgPzuOqusssiKwA2C2HvrXfGxMD4v5D4ooCW/3F8g4zdrEVL enGD+2QGwBx1H5NQ6ekQru9W744D8XncV4cxg2+0HGZ4MyaXU1v6rQ049itNjopE oiwgFjsN9Zafzs42dMzLB3HdXgdI8r++sAsbhYt48Z+Q8R4sy2hboucbxNBoLM34 Lo3zuzxrGrqExektw19RNSGV+aZBqb6BZjQoVA8tUvDqBzpHR3tm/Fa/iko87CP0 G1KnZqb0zWbgROHtm50C/7iMJ8/C3Pe2IRjY4Uu818M4IffF0co4D2BNjgL6wNs= =Vh7Y -----END PGP SIGNATURE----- --------------enig564913963B569E4B290B46AF--