白話演算法 -- 培養程式設計的邏輯思考 ( Python )
- 開始：2021/06/26 購於三民書局 ( 蝦皮 )
- 目標：2021/07/31 前把這本書的內容都看完及練習一遍
| 章節 | 主題 | 開始:date: | 完成:date: | 狀態 |
|---|---|---|---|---|
| 01 - Binary Search (二元搜尋法) |
2021/06/26 | 2021/06/26 | 🎉👏 | |
| 01. Binary Search | 2021/06/26 | 2021/06/26 | 😃 | |
| 02. Big O notation | 2021/06/26 | 2021/06/26 | 😃 | |
| 02 - Selection Sort (選擇排序法) |
2021/06/26 | 2021/06/26 | 🎉👏 | |
| 01. 記憶體是如何運作的呢? | 2021/06/26 | 2021/06/26 | 😃 | |
| 02. Array & Linked List | 2021/06/26 | 2021/06/26 | 😃 | |
| 03. Selection Sort | 2021/06/26 | 2021/06/26 | 😃 | |
| 03 - Recursion (遞迴) |
2021/06/27 | 2021/06/27 | 🎉👏 | |
| 01. Recursion | 2021/06/27 | 2021/06/27 | 😃 | |
| 02. Base Case & Recursive Case | 2021/06/27 | 2021/06/27 | 😃 | |
| 03. Stack | 2021/06/27 | 2021/06/27 | 😃 | |
| 04 - Divide-and-Conquer & Quicksort | 2021/06/27 | 2021/06/28 | 🎉👏 | |
| 01. Divide-and-Conquer (D&C) | 2021/06/27 | 2021/06/28 | 😃 | |
| 02. Quicksort | 2021/06/28 | 2021/06/28 | 😃 | |
| 03. Big O notation 的執行時間 | 2021/06/28 | 2021/06/28 | 😃 | |
| 05 - Hash table (雜湊表) |
2021/06/28 | ✍️ | ||
| 01. Hash Function & Hash Table | 2021/06/28 | 2021/06/29 | 😃 | |
| 02. Hash Table 應用 | 2021/06/29 | 2021/07/12 | 😃 | |
| 03. Collision | 2021/07/12 | 2021/07/12 | 😃 | |
| 04. Performance | 2021/07/12 | 😃 | ||
| 06 - Breadth-First Search (廣度優先搜尋) |
||||
| 01. 認識「圖形」 | ||||
| 02. Shortest-Path Problem | ||||
| 03. Breadth-First Search | ||||
| 04. Implementing the graph | ||||
| 05. Implementing the algorithm | ||||
| 07 - Dijkstra (戴克斯特拉演算法) |
||||
| 01. Dijkstra 搭配圖形的運作 | ||||
| 02. 專有名詞解釋 | ||||
| 03. Dijkstra 應用 - 用鋼琴換樂譜 | ||||
| 04. Negative-weight edge | ||||
| 05. Implementing Dijkstra | ||||
| 08 - Greedy Algorithm (貪婪演算法) |
||||
| 01. Classroom Scheduling Problem | ||||
| 02. Knapsack Problem | ||||
| 03. Set Covering Problem | ||||
| 04. NP-Complete Problem | ||||
| 09 - Dynamic Programming Algorithm (動態規劃演算法) |
||||
| 01. Knapsack Problem | ||||
| 02. Knapsack Problem Q&A | ||||
| 03. Longest Common Substring | ||||
| 10 - K-Nearest Neighbors Algorithm (K-最近鄰演算法) |
||||
| 01. 柳橙和葡萄柚的分類 | ||||
| 02. 建立電影推薦系統 | ||||
| 03. 機器學習簡介 | ||||
| 11 - 進階之路 : 推薦 10 種演算法 | ||||
| 01. 樹狀結構 | ||||
| 02. Inverted Index (反向索引) | ||||
| 03. Fourier Transform (傅立葉轉換) | ||||
| 04. Parallel Algorithm (平行演算法) | ||||
| 05. MapReduce | ||||
| 06. Bloom Filter & HyperLogLog | ||||
| 07. Secure Hash Algorithm (SHA 演算法) | ||||
| 08. Locality-Sensitive Hashing (局部敏感雜湊) | ||||
| 09. Diffie-Hellman Key Exchange (迪菲赫爾曼金鑰交換) | ||||
| 10. Linear Programming (線性規劃) |
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent