Algorithms in Python (was: Python Books for 2002)
Cameron Laird
claird at starbase.neosoft.com
Thu Apr 5 09:23:26 EDT 2001
In article <mailman.986440747.20177.python-list at python.org>,
Tim Peters <tim_one at email.msn.com> wrote:
.
.
.
>the mailing list before that. Most examples of efficient algorithm design
>in Python boil down to this handy recipe, suitable for printing on a
>practical (yet attractive) wallet card:
>
>1. Use dicts heavily, in the obvious but only appropriate ways.
>2. If your approach to the problem doesn't involve dicts, throw
> out your approach, dream up another, and repeat step 2.
>3. Go back to step 1.
>
>ya-ok-so-it-doesn't-work-well-for-sorting-but-that's-why-sorting-is-
> built-in-ly y'rs - tim
>
>
Sooooo true.
Also, lean on namespaces, to make it presentable.
--
Cameron Laird <claird at NeoSoft.com>
Business: http://www.Phaseit.net
Personal: http://starbase.neosoft.com/~claird/home.html
More information about the Python-list
mailing list