mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-29 20:26:07 -04:00
start refactor
This commit is contained in:
parent
8a9868fe7d
commit
ea7a3fdfbb
103
README.md
103
README.md
@ -1,87 +1,52 @@
|
|||||||
# Python, Algorithms, and Data Structures (Book)
|
## 👾🐍 master python with algorithms (my book 🖤)
|
||||||
|
|
||||||
<br>
|
<br>
|
||||||
|
|
||||||
#### This repository contains my book on Algorithms and Data Structure in Python, published by [Hanbit Media](https://www.hanbit.co.kr/store/books/look.php?p_code=B8465804191) in 2014.
|
|
||||||
|
|
||||||
#### 👉 [4.6/5 stars and 33 reviews for a book written in school, not bad :)](https://www.hanbit.co.kr/store/books/look.php?p_code=B8465804191)
|
|
||||||
|
|
||||||
#### 👉 [here is a pic when this repo used to have 600+ stars and 300 forks (before 💩 happened 😞)](600_stars.png)
|
|
||||||
|
|
||||||
#### 👉 [this book as a reference for a CMU computer science class](https://www.andrew.cmu.edu/user/ramesh/teaching/course/48784.pdf)
|
|
||||||
|
|
||||||
<br>
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
|
|
||||||
<p align="center">
|
<p align="center">
|
||||||
<img src="https://user-images.githubusercontent.com/1130416/156927662-1cc6d09f-1124-4a87-8c40-10159b24d307.jpeg" width="50%" align="center" style="padding:1px;border:1px solid black;">
|
<img src="https://user-images.githubusercontent.com/1130416/156927662-1cc6d09f-1124-4a87-8c40-10159b24d307.jpeg" width="30%" align="center" style="padding:1px;border:1px solid black;">
|
||||||
</p>
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
<p align="center">
|
|
||||||
<img src="https://user-images.githubusercontent.com/1130416/234332753-28e8e671-1327-4069-b2cb-f9dbe0c77623.png" width="50%" align="center" style="padding:1px;border:1px solid black;">
|
|
||||||
</p>
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
<p align="center">
|
|
||||||
<img src="https://user-images.githubusercontent.com/1130416/156927665-8f574012-bb9d-4698-bef2-bb4f5173d63c.png" width=90%" align="center" style="padding:1px;border:1px solid black;">
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p align="center">
|
|
||||||
<img src="https://user-images.githubusercontent.com/1130416/156927666-04e64766-8d8b-4973-a2b1-6e0c48dc6cc1.jpeg" width=90%" align="center" style="padding:1px;border:1px solid black;">
|
|
||||||
|
|
||||||
<p align="center">
|
|
||||||
<img src="https://user-images.githubusercontent.com/1130416/156927664-25102b50-301c-4d18-aa15-b399b9716ff1.png" width=90%" align="center" style="padding:1px;border:1px solid black;">
|
|
||||||
</p>
|
</p>
|
||||||
|
|
||||||
<br>
|
<br>
|
||||||
|
|
||||||
----
|
### in this repo
|
||||||
|
|
||||||
<br>
|
<br>
|
||||||
|
|
||||||
### Summary
|
* **[📖 my book on algorithms and data structure in python (2014)](book)**:
|
||||||
|
- **one of the first ever publication to solve classic computer science algorithm and data structure problems in python.**
|
||||||
|
- **[it was published by hanbit media in 2014](https://www.hanbit.co.kr/store/books/look.php?p_code=B8465804191)**.
|
||||||
|
- **[as of today, has 4.6/5 stars and 33 reviews](https://www.hanbit.co.kr/store/books/look.php?p_code=B8465804191)**.
|
||||||
|
- **[this book as a reference for a CMU computer science class](https://www.andrew.cmu.edu/user/ramesh/teaching/course/48784.pdf)**.
|
||||||
|
- **[here is a pic when this repo used to have 600+ stars and 300 forks (before 💩 happened 😞)](book/600_stars.png)**.
|
||||||
|
|
||||||
|
|
||||||
* This book as one of the first publications to solve the classic computer science algorithm and data structure problems in Python.
|
|
||||||
|
|
||||||
* [Here is the PDF for the free e-book](https://github.com/bt3gl/Book_on_Python_Algorithms_and_Data_Structure/blob/master/book/ebook_pdf/book_second_edition.pdf).
|
|
||||||
|
|
||||||
* [Here is the source code, including abstract structures, bitwise operations, builtin Python data structures, searching and sorting, trees, and real interview problems](https://github.com/bt3gl/Book_on_Python_Algorithms_and_Data_Structure/tree/master/book/ebook_src).
|
|
||||||
|
|
||||||
<br>
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
<br>
|
<br>
|
||||||
|
|
||||||
|
|
||||||
### [The Zen of Python](https://www.python.org/dev/peps/pep-0020/)
|
|
||||||
|
|
||||||
|
|
||||||
```
|
|
||||||
Beautiful is better than ugly.
|
<p align="center">
|
||||||
Explicit is better than implicit.
|
<img src="https://user-images.githubusercontent.com/1130416/156927666-04e64766-8d8b-4973-a2b1-6e0c48dc6cc1.jpeg" width=60%" align="center" style="padding:1px;border:1px solid black;">
|
||||||
Simple is better than complex.
|
|
||||||
Complex is better than complicated.
|
<br>
|
||||||
Flat is better than nested.
|
<br>
|
||||||
Sparse is better than dense.
|
<br>
|
||||||
Readability counts.
|
|
||||||
Special cases aren't special enough to break the rules.
|
|
||||||
Although practicality beats purity.
|
* **📖 algorithms and data structures revisited (2023)**:
|
||||||
Errors should never pass silently.
|
* 𝟘𝟘𝟙𝟘. **[arrays, vectors, strings](arrays_and_strings)**
|
||||||
Unless explicitly silenced.
|
* 𝟘𝟘𝟙𝟙. **[linked lists](linked_lists)**
|
||||||
In the face of ambiguity, refuse the temptation to guess.
|
* 𝟘𝟙𝟘𝟘. **[stacks and queues](stacks_and_queues)**
|
||||||
There should be one-- and preferably only one --obvious way to do it.
|
* 𝟘𝟙𝟘𝟙. **[bit manipulation](bit_manipulation)**
|
||||||
Although that way may not be obvious at first unless you're Dutch.
|
* 𝟘𝟙𝟙𝟘. **[math and logic](math_and_logic)**
|
||||||
Now is better than never.
|
* 𝟘𝟙𝟙𝟙. **[object-oriented design](object_oriented_design)**
|
||||||
Although never is often better than *right* now.
|
* 𝟙𝟘𝟘𝟘. **[recursion and dynamic programming](recursion_and_dp)**
|
||||||
If the implementation is hard to explain, it's a bad idea.
|
* 𝟙𝟘𝟘𝟙. **[sorting and searching](sorting_and_searching)**
|
||||||
If the implementation is easy to explain, it may be a good idea.
|
* 𝟙𝟘𝟙𝟘. **[concurrency](concurrency)**
|
||||||
Namespaces are one honking great idea -- let's do more of those!
|
* 𝟙𝟘𝟙𝟙. **[trees and graphs](trees_and_graphs/)**
|
||||||
```
|
|
||||||
|
|
||||||
|
|
0
arrays_and_strings/README.md
Normal file
0
arrays_and_strings/README.md
Normal file
0
bit_manipulation/README.md
Normal file
0
bit_manipulation/README.md
Normal file
Before Width: | Height: | Size: 665 KiB After Width: | Height: | Size: 665 KiB |
@ -1,15 +0,0 @@
|
|||||||
## Python, Algorithms and Data Structures (2014)
|
|
||||||
|
|
||||||
[Download PDF (first edition, published by Hanbit Media)](https://github.com/bt3gl/Python-and-Algorithms-and-Data-Structures/blob/master/First_edition_2014/ebook_pdf/book_second_edition.pdf).
|
|
||||||
|
|
||||||
|
|
||||||
## To run the snippet:
|
|
||||||
|
|
||||||
Install dependencies in a [virtual environment](https://coderwall.com/p/8-aeka):
|
|
||||||
|
|
||||||
```
|
|
||||||
virtualenv venv
|
|
||||||
source venv/bin/activate
|
|
||||||
pip install -r requirements.txt
|
|
||||||
```
|
|
||||||
|
|
@ -1,13 +0,0 @@
|
|||||||
Flask==2.2.5
|
|
||||||
SQLAlchemy==0.9.7
|
|
||||||
bpython==0.13.1
|
|
||||||
coverage==3.7.1
|
|
||||||
curtsies==0.0.34
|
|
||||||
graphviz==0.4.2
|
|
||||||
ipython==8.10.0
|
|
||||||
matplotlib==1.3.1
|
|
||||||
nose==1.3.0
|
|
||||||
numpy==1.22.0
|
|
||||||
scapy==2.4.1
|
|
||||||
scikit-learn==0.14.1
|
|
||||||
scipy==1.10.0
|
|
0
concurrency/README.md
Normal file
0
concurrency/README.md
Normal file
0
linked_lists/README.md
Normal file
0
linked_lists/README.md
Normal file
0
math_and_logic/README.md
Normal file
0
math_and_logic/README.md
Normal file
0
object_oriented_design/README.md
Normal file
0
object_oriented_design/README.md
Normal file
0
recursion_and_dp/README.md
Normal file
0
recursion_and_dp/README.md
Normal file
0
sorting_and_searching/README.md
Normal file
0
sorting_and_searching/README.md
Normal file
0
stacks_and_queues/README.md
Normal file
0
stacks_and_queues/README.md
Normal file
0
trees_and_graphs/README.md
Normal file
0
trees_and_graphs/README.md
Normal file
Loading…
x
Reference in New Issue
Block a user