Path: csiph.com!usenet.pasdenom.info!news.albasani.net!newsfeed.freenet.ag!news2.euro.net!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail
Newsgroups: comp.lang.python
Date: Thu, 27 Sep 2012 04:15:55 -0700 (PDT)
In-Reply-To: <mailman.1447.1348675519.27098.python-list@python.org>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=123.192.32.215; posting-account=5JdMBQoAAABHnS4mjpqEzxnmWtgiiVNw
References: <TYV6s.7304$Vh6.4862@newsfe20.iad> <jngp58p2mq1nrov4l0tj29e891vrg8vo6b@invalid.netcom.com> <mailman.1447.1348675519.27098.python-list@python.org>
User-Agent: G2/1.0
MIME-Version: 1.0
Subject: Re: Algorithms using Python?
From: 88888 Dihedral <dihedral88888@googlemail.com>
To: comp.lang.python@googlegroups.com
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
Cc: python-list@python.org, Dennis Lee Bieber <wlfraed@ix.netcom.com>
Precedence: list
Message-ID: <mailman.1484.1348744564.27098.python-list@python.org>
Lines: 129
NNTP-Posting-Host: 2001:888:2000:d::a6
Xref: csiph.com comp.lang.python:30290

Wayne Werner=E6=96=BC 2012=E5=B9=B49=E6=9C=8827=E6=97=A5=E6=98=9F=E6=9C=9F=
=E5=9B=9BUTC+8=E4=B8=8A=E5=8D=8812=E6=99=8205=E5=88=8631=E7=A7=92=E5=AF=AB=
=E9=81=93=EF=BC=9A
> On Fri, 21 Sep 2012, Dennis Lee Bieber wrote:
>=20
>=20
>=20
> > On Fri, 21 Sep 2012 14:26:04 +0530, Mayuresh Kathe <mayuresh@kathe.in>
>=20
> > declaimed the following in gmane.comp.python.general:
>=20
> >
>=20
> >> Is there a good book on foundational as well as advanced algorithms
>=20
> >> using Python?
>=20
> >>
>=20
> > 	Depends on what you mean by "foundational"...
>=20
> >
>=20
> > 	Since Python has dynamic lists and dictionaries, I suspect you won't
>=20
> > find any textbook focusing on linked-list or hashed lookup algorithms
>=20
> > using Python.
>=20
> >
>=20
> > 	You can probably implement them, but they're not going to be very
>=20
> > efficient. (And never "remove" an element from the linked-list
>=20
> > implementation because Python would shift all the other elements, hence
>=20
> > your "links" become invalid).
>=20
>=20
>=20
> It's quite inefficient, but it would be fairly trivial to create a LL=20
>=20
> implementation like this:
>=20
>=20
>=20
> class Link:
>=20
>      def __init__(self):
>=20
>          self.next =3D None
>=20
>          self.value =3D None
>=20
>=20
>=20
> class LinkedList:
>=20
>      def __init__(self):
>=20
>          self.head =3D None
>=20
>=20
>=20
>      def add(self, value):
>=20
>          node =3D Link()
>=20
>          node.value =3D value
>=20
>          self.append(node)
>=20
>=20
>=20
>      def append(self, node):
>=20
>          # Write some code
>=20
>=20
>=20
> It's fairly easy to use reference types as one would use pointers in=20
>=20
> <language>.
>=20
>=20
>=20
> But it might actually require understanding pointers and such in the firs=
t=20
>=20
> place...
>=20
>=20
>=20
> I'm not really aware of any algorithm that's impossible/harder to=20
>=20
> implement in Python - Python just makes most things a lot easier so you=
=20
>=20
> never have to deal with the lower level algorithms. Which makes *me* happ=
y=20
>=20
> :)
>=20
>=20
>=20
> -Wayne

In python  long integers of varried lengths of precesions, doubles,=20
complex numbers,  immutable tuples, modifiable lists, modifiable dictionari=
es,
and functions and classes are all name resolved  basic built in types.


It is more interesting to implement a binary tree in python from=20
a dictionary.

Also the set part can be implemented by long integers or dictionaries.

The symbolic computation part as in sympy is also a good example=20
of high level programmings in python.

But this also means a lot kids will finish their calculous  homeworks=20
trivially by machines instead of  reasoning and learning in person.