👾 my detailed walk-through for mastering classical algorithm and data structure problems (and the book i published by hanbit media a decade ago)
Find a file
2022-03-06 06:32:18 -08:00
.github 🐮 Updating funding 2020-03-22 10:23:18 -07:00
book 🏣 Clean up for arxiv 2020-03-04 17:47:53 -08:00
.gitignore 🕍 Clean up gitignore 2019-10-27 20:29:50 -07:00
README.md Update README.md 2022-03-06 06:32:18 -08:00
requirements.txt 🎡 Remove flask 2019-10-27 20:34:18 -07:00

Python, Algorithms, and Data Structures (Book)

Hi, I am bt3, and this repository contains my book on algorithms and data structure in Python.


155714470-ab2bbb74-6655-46bd-a85d-eeea5b5d1c5e 155714475-8217d63b-3fd5-4624-8de3-ebadb4a3ff82 155714481-0eda9456-69d6-4635-adbc-750a2897ed39 155714691-03c77206-9103-42cd-9d85-f63a308ee45b

The Zen of Python

Beautiful is better than ugly.
Explicit is better than implicit.
Simple is better than complex.
Complex is better than complicated.
Flat is better than nested.
Sparse is better than dense.
Readability counts.
Special cases aren't special enough to break the rules.
Although practicality beats purity.
Errors should never pass silently.
Unless explicitly silenced.
In the face of ambiguity, refuse the temptation to guess.
There should be one-- and preferably only one --obvious way to do it.
Although that way may not be obvious at first unless you're Dutch.
Now is better than never.
Although never is often better than *right* now.
If the implementation is hard to explain, it's a bad idea.
If the implementation is easy to explain, it may be a good idea.
Namespaces are one honking great idea -- let's do more of those!