This is a summary of How to Design Programs: An Introduction to Programming and Computing, abbreviated HTDP.
Read Moreaqua-ified thoughts
never developed nor fully solidified
I forgot my favorite method of deriving Y combinator for the n-th time, so this time I am forcing myself to write this up as a quick reminder.
Read MoreLately I have been forcing many of my friends to listen/watch this mini-lecture of mine about Haskell and infinite streams. I thought it was pretty cool, so I wanted to share it here too.
Read MoreIn which I nerd about SICP.
Read MoreLast time, I wrote about my first-month impression of the COVID-infested Fall semester. It has been three months since then, and I’m honestly surprised at how fast it was. Yet, simultaneously, each week felt painfully slow. I guess this is what happens when there are a lot of deadlines and your brain can only handle so many at once.
Read Moreส่วนใหญ่แล้วโจทย์กราฟที่เราพบในการแข่งขันต่าง ๆ หรือพวกโจทย์สัมภาษณ์ มักจะเป็นโจทย์ที่ประยุกต์ใช้ Graph Algorithms บน input graph ตรง ๆ เช่น
- Depth-first Search/Breadth-first Search สำหรับท่องกราฟ
- Dijkstra’s Algorithm สำหรับหา Single-source Shortest Path
- Kruskal’s Algorithm สำหรับหา Minimum Spanning Tree