---
# System prepended metadata

title: 演算法讀書會行前須知(已結束)
tags: [行前準備]

---

> ###### tags: `行前準備` 

# 演算法讀書會行前須知(已結束)
1. 使用markdown 協作筆記
2. 每週輪流分享
3. 讀書會討論時間長度(一個小時為限) 一個人15分鐘。
4. 每週六晚上十點
 
### 要上哪一堂課
1. [台大 ADA 2022](https://www.youtube.com/watch?v=E9325Kh9kWk&list=PLOAQYZPRn2V6ms1JSww6pqXKf5x0o_gan)
<!-- 2. [陽交大](http://ocw.nctu.edu.tw/course_detail-v.php?bgid=8&gid=0&nid=493)
3. [陽交大2](https://youtu.be/3503j2L6qNA)
4. [史丹佛](https://zh-tw.coursera.org/specializations/algorithms)
5. [清大](https://ocw.nthu.edu.tw/ocw/index.php?page=chapter&cid=252&chid=2772&video_url=https%3A%2F%2Focw.nthu.edu.tw%2Fvideosite%2Findex.php%3Fop%3Dwatch%26id%3D8244%26filename%3D1280_720_1536.MP4%26type%3Dview%26cid%3D252%26chid%3D2772&name=L1A) -->
- [課本](https://sd.blackball.lv/library/Introduction_to_Algorithms_Third_Edition_(2009).pdf)


### Playlist
課程0.1節當單位。
☐☑︎
|read|topic|host|date|
|-|-|-|-|
|☑︎|[ADA 1.1: Introduction]()|Alvin|Oct 1|
|☑︎|[ADA 1.2: Asymptotic Analysis]()|Kyle|Oct 8|
|☑︎|[ADA 1.3: Algorithm Complexity & Problem Complexity]()|Roger|Oct 15|
|☑︎|[ADA 2.1: Divide-and-Conquer Introduction](https://youtu.be/8z38YbaFnrQ)|Peggy|Oct 22|
|☑︎|[ADA 2.2: Recurrence](https://youtu.be/7OHsmzyjMy8)|Peggy|Oct 22|
|☑︎|[ADA 2.3: Hanoi Tower](https://youtu.be/NoDYJ1D4Eao)  \[[⑳②①](https://youtu.be/DzG2mrWRFyY)\]|Woody|Oct 22|
|☑︎|[ADA 2.4: Merge Sort](https://youtu.be/cnY6uqAk8ps)|Dogpa|Oct 29|
|☑︎|[ADA 2.5: Bitonic Champion Problem](https://youtu.be/-EoKDv-eRpw)|EachYang|Oct 29|
|☑︎|[ADA 2.6: Maximum Subarray](https://youtu.be/5-hahZ4DW3Y)|哈哈涵|Oct 29|
|☑︎|[ADA 3.1: Solving Recurrences & Substitution Method](https://youtu.be/Y4uPe9MvNis)|Leo|Nov 5|
|☑︎|[ADA 3.2: Recursion-Tree Method](https://youtu.be/jrG4mdfsWYg)|Allen|Nov 5|
|☑︎|[ADA 3.3: Master Method](https://youtu.be/3TzPq2Samwk)|Andy|Nov 5|
|☑︎|[ADA 4.1: Matrix Multiplication](https://youtu.be/BQDACz1B5vU)|Wen|Nov 12|
|☑︎|[ADA 4.2: Selection Problem](https://youtu.be/Nabsc-ycltM)|Andrew|Nov 12|
|☑︎|[ADA 4.3: Closest Pair of Points](https://youtu.be/E16kuAEOpsM)|Leo|Nov 19|
|☑︎|[ADA 5.1: Dynamic Programming](https://youtu.be/x3BCX9hBWZQ)|Xander|Nov 19|
|☑︎|[ADA 5.2: Rod Cutting Problem](https://youtu.be/Jr9bD1oXO10)|Xander|Nov 19|
|☑︎|[ADA 5.3: Stamp Problem](https://youtu.be/NdRGCiGpVYw)|Dogpa|Nov 26|
|☑︎|[ADA 5.4: Matrix-Chain Multiplication](https://youtu.be/eaNrsxPkqTg)|哈哈涵|Nov 26|
|☑︎|[ADA 6.1: AlphaTensor & Prisoner's dilemma](https://youtu.be/gcuvZw8nHEc)|Peggy|Dec 3|
|☑︎|[ADA 6.2: Weighted Interval Scheduling](https://youtu.be/4NVBJNH1Eu8)|Woody|Dec 3|
|☑︎|[ADA 6.3: Sequence Alignment](https://youtu.be/eVKkpS5vfWg)|Woody|Dec 3|
|☑︎|[ADA 6.4: Space-Efficient Sequence Alignment](https://youtu.be/PnDbN6qqWiY)|Andy|Dec 10|
|☑︎|[ADA 6.5: Knapsack Problem](https://youtu.be/wNFypN2glsA)|Andy|Dec 10|
|☑︎|[ADA 6.6: Pseudo Polynomial](https://youtu.be/sU4kB_NuaAQ)|Andy|Dec 10|
|☑︎|[ADA 7.1: Greedy Algorithms](https://youtu.be/Qy9O90Bwklc)|Xander|Dec 17|
|☑︎|[ADA 7.2: Activity Selection / Interval Scheduling](https://youtu.be/wrQPZdtwupU)|Xander|Dec 17|
|☑︎|[ADA 7.3: Coin Changing](https://youtu.be/OeYYcP14ZBw)|Roger|Dec 17|
|☑︎|[ADA 7.4.1: Huffman Codes](https://youtu.be/47kS_Em9SKU)|Andy|Dec 24|
|☑︎|[ADA 7.4.2: Huffman Codes](https://youtu.be/47kS_Em9SKU)|Andy|Jan 7|
|☑︎|[ADA 8.1: Fractional Knapsack Problem](https://youtu.be/zf4dxqxwRNU)|Peggy|Jan 7|
|☑︎|[ADA 8.2: Breakpoint Selection Problem](https://youtu.be/FJzJyRkQNJk)|Andrew|Jan 7|
|☑︎|[ADA 8.3: Task Scheduling](https://youtu.be/w_QtxQLHAUk)|Wen|Jan 14|
|☑︎|[ADA 8.4: Scheduling to Minimize Lateness](https://youtu.be/5h6IIwyV-Rs)|Wen|Jan 14|
|×|[ADA 9.1: Midterm Review](https://youtu.be/B3GPhHP6tr0)|Andy|Jan 14|
|×|[ADA 9.2: Exercises](https://youtu.be/GJaMz8fSUmc)|Andy|Jan 14|
||```畢業了```|||

