Hacker News Comments on
Stanford Lecture - Don Knuth: The Analysis of Algorithms
stanfordonline
·
Youtube
·
17
HN points
·
1
HN comments
HN Theater has aggregated all Hacker News stories and comments that mention stanfordonline's video "Stanford Lecture - Don Knuth: The Analysis of Algorithms".
Youtube Summary
HN Theater Rankings
- This course is unranked · view top recommended courses
Hacker News Stories and Comments
All the comments and stories posted to Hacker News that reference this video.
⬐
Feb 20, 2018
·
arconis987 on
Ask HN: Is it 'normal' to struggle so hard with work?
It was from a video where Don Knuth recreated one of his first lectures.At one point around 20 or 30 minutes in, he says something like, “We’re going to start easy and slow and then work harder later on.” He exhaustively writes out a large number of different combinations of possible runtimes of an algorithm. It seems quite tedious, but eventually some cool results emerge related to Sterling Numbers :)
At first, I thought it was somewhat annoying that the lecture was methodically going through so many examples. Since then, I’ve realized that methodically going through small sub-problems patiently is often the way you eventually get to a giant leap.
⬐
⬐ ClearAsMudI miss Dijkstra. He always new the fastest way to make me happy.