The instructor, Erik Demaine, is the youngest professor of all time at MIT and a child prodigy. He has published several articles in scientifical journals, and and now has helped several students publish their own articles. He is one of the modern day geniuses of our time. We are extremely lucky to have a free video of his lecturing.

Watching this 6 years after graduation. The irony of skipping class...

I just googled him to know that he finished his bachelor's degree at 14 years of age at Dalhousie University in Canada. damnn!!!!

stop scrolling down listen to this guy

Introduction to Dynamic Programming: 00:21 Fibonacci Numbers: 6:01 Fibonacci Numbers with Memoisation: 11:11 Fibonacci Numbers using bottom-up approach: min 23:25 Shortest paths: 31:05

He is really putting an effort for students....these kind of teachers r very rare to find

So apparent why MIT students are industry leaders.... their teachers are amazing. My data structures and algorithms professor was trash at my university, and it is a well respected school.

Absolutely fascinating lecture. This guy received his master of science in mathematics at the age of 16.

I love this guy. I can tell he enjoys teaching.. best trait a lecturer can have :)

00:58 dynamic programming (DP) 05:06 Fibonacci numbers 11:04 memoized DP algorithm 23:14 bottom-up DP algorithm 31:00 shortest paths 41:14 example

I am 55 years old and whenever I watch a lecture from MIT or Stanford, I so wish I could study there! I feel so mesmerized.

Not only is he knowledgeable but he’s also one of those teachers that makes you really get interested in the lesson

I watched this guys couple of old lectures quite sometime back and he made me fall in love with dynamic programming. Love this guy.

"This is kind of obvious" Me: Leaving the lecture hall with my head down.

I'm from Perú and following a Software Engineering, although we sometimes may get an overall view of these kind of topics, we tend to stay in the easy zone and never go any further from that. Having access to these many MIT real lectures just makes me so happy because, even if you don't enjoy the best education, you stil have the opportunity to learn more from reliable sources. And for me, that's what the MIT, give opportunities and hope. Thank you so much!

Thank you for caring about the subtitles quality, they made it possible to follow up the whole class.

Professor Demaine, I really enjoy your confident lectures.

I just want to thank you for this video and other related videos from this channel. While working fulltime and schooling at night it is hard sometimes to follow through my classes. However, I managed to earn a MS Computer Science concentration on Network and Security with a big thanks to these videos. Thank you!!

Thank you guys. I am doing my masters though I couldn't get in MIT, you give me exposure to top class teaching materials.

I love how Erik is so humble and approachable. It's so great that MIT recognized him so early as a faculty member. This is so important for students and progress in education and research. MIT is really showing the way for other universities how the modern education is meant to be. Erik stay cool and keep improving this wonderful series of lectures. All the best!

My favorite DP lecture yet!

Really a great video 🙌 Have fallen in love with recursion and DP with this video , Great work Erik Sir 👏

I love how much passion and energy the Prof got

Amazing lecture from Erik Demaine. It's impressive how easy he explains a topic like dynamic programming and how he can have the attention of the students in the hall. Thank you very much to Erik for his lecture and to MIT for sharing this excellent course!!! I can't wait to see the next DP classes!!!

Best Algorithm lecture ever seen...Thank You MIT for this Lecture and Eric is one the best lecturer with great teaching skills.

i love love love Erik's teaching style. usually, i feel pretty dumb when i don't get a concept when my professor or other youtube videos explain but Erik makes it very.....accessible, and relatable.

Mannn, Sir Erik is so passionate professor I have ever seen. I just love the way he explains🙏🙏🙏

What a guy he is!!! Just to say been through a lot of mit stuff but he really is matching the skills of all other professors in that place

I've always thought of Dynamic Programming as this big, scary, complicated concept that would take forever to understand. Erik helped me understand it easily.

My goal: binge watch mit course playlist for the whole day :)

Great lecture! Thank you for making this topic accessible - in all senses of the word

I've been watching many video professor teaching in UKposts....Professor Erik Demaine definitely the best one that I've ever saw...His teaching style really on top.

26:10 "So is this clear what this is doing? I think so." [Then corrects the 2nd, 3rd, 4th and 5th typos that prevented comprehension. :) ]

this guy is awesome . very clear explaination..

Eriks lectures are awesome... pretty decent walkthrough of dynamic programming.

This man is absolutely brilliant. Perhaps too brilliant for anyone in the lecture hall to understand, and certainly for me.

the best algorithm lecture i have ever seen! I prefer this "old-style" lecture using blackboard and chalks so much without any bullshit slides and whiteboards

@26:36: "Man, so many typos" - How I feel whenever I'm coding up on the board.

After following 2-3 lectures of him, He became my favorite prof

Amazing lecture, Erik can really explain. Thanks!

Great teaching! I had an algorithmic challenge this year, the solution was dynamic programming.

If this guy was my professor I might have not dropped out! We need ppl like him thank you for sharing this

geniously simply explained! thank you! helped me a lot!

Lovely course! Awesome Profs.. I came here looking for help in trying to solve DP problems.. got glued to this video and the other videos in the course.. heard of the Double Rainbow for the first time and googled for it.. came to know about the Double Rainbow guy.. and read that he became one with the rainbow ... in the times of this pandemic.. strange how times fly by! ...and how time flies by!

that's genius, Erik has got some great teaching skillz, man

# for def fibonacci(n): r = [1, 0] for i in range(1, n+1): a = r[0] b = r[1] c = a + b r[0] = b r[1] = c return r[1] if __name__=="__main__": for n in range(1, 101): print(n, ": ", fibonacci(n))

Best tutorial on Dynamic programming I have ever seen :)

Absolutely love this guy, what a great lecturer

Love the giant eraser. Must be quite satisfiying using it.

I really love how they teach, everything becomes interesting..., i wish i could study full time there :D

What an excellent explanation and professor. Very well done!

Great class ! Thanks for uploading that.

I wish my prof taught my algo class was this excited about any of the algos, instead of sitting there hating life

Very great lecture, super helpful. Thank you MIT.

Best lecture on the subject i've seen on youtube

I am amazed just at his writing on the board at the very beginning .

I wish I could have Professor like him in my bachelor's and master's .

This instructor ROCKS!

I absolutely love that chalk... Kind of gets you interested in the topic...

Don't know much about Dynamic Programming but do note the professor's unique and rather attractive chalkboard writing! And being a dapper hand myself at it, I salute you Prof!

Thank you sooooo much! A lot easier than learning from the economic side.

Great lecture!

I gotta say, this video series helps me to understand how to solve DP problem easily. For people trying to learn how to solve DP , what I recommend to do is to just watch all the series to understand the pattern (observe) then try to solve some other problems on internet (practise).

at 47:06 Eric mentions, we need to make the graph acyclic, we don't need to make the graph acyclic, we can mark the vertex which is being computed (which is in the call stack) as present in an infinite distance and use it's TAB[v]

I love those boards and chalk!

23:22, hey... even I like the recursion based top-down approach over bottom up. Btw, very good teacher.

Awesome! Thanks Eric & MIT for the great content

Wonderful lecture, Thanks for explaining the term.

way better than my current algorithms professor...thanks!

Algorithms Professor wearing a Bob Dylan T-shirt! Awesome!

That is the most computer-dude looking guy ive ever seen, very apt.

I felt like this was a great way to explain dynamic programming. My course work on it in college was fine enough for me to understand it but this is a much easier better way to explain it to learn from.

Dynamic programming the my favrourite thing in the world... in algorithms.

You kept on scrolling anyway, didn't you? ;)

What a great person. He is making a very complicated topic at least a bit understandable for me :)

I am amazed there are actually ppl who understand and can make sense of this.

When I came to know about the name story of DP, I was also very excited. If anyone has done the course algorithmic toolbox, you might also be knowing this story!

Extra credit for the Bob Dylan T-shirt! :D

This teacher is amazing!! I loved it!

0:00~31:00 DP 설명. - 벨만 포드 알고리즘 만든 벨만이 다이나믹 프로그래밍이라는 이름을 창시했다. 벨만이 다이나믹 프로그래밍이라고 이름 지은 이유는 별 뜻 없고 '그냥 멋있어 보여서'다. - 하나의 문제를 완전탐색으로 재귀적으로 풀 때 그 문제의 부분문제(Subproblems)의 답을 재활용하는 기법이 메모아이제이션(Memoization)이다. 재귀로 문제를 풀면 exponential 시간이 소요되는데, 한 번 풀었던 문제의 답을 메모로 적어 놓고 다시 필요할 때 반환함으로써 그 문제 풀이는 O(1) 시간밖에 걸리지 않는다. - DP에는 재귀적인 구현인 하향식 접근(Top-down approach) 외에도 반복문을 이용한 상향식 접근(Bottom-up approach) 방법이 있다. 상향식은 함수 호출을 적게 하니까 스택을 적게 먹는 장점이 있겠지. - 시간복잡도: 부분 문제의 갯수 * 부분 문제를 푸는 데에 걸리는 시간(메모 해 놔서 재귀 안 걸리는 데는 O(1)임) ---------- 31:00 이후 최단 경로 설명. - 오랫동안 잊고 있었던 그래프 이론이 등장함. / - 정점(vertex, node), 간선(edge, link, line) - 차수(degree): 어떤 정점의 간선의 수. / - DAG (Directed Acyclic Graph): 비순환 유향(방향) 그래프 - 내차수(indegree): 방향 그래프에서 어떤 정점으로 들어오는 간선(incoming edge)의 수. - 외차수(outdegree): 방향 그래프에서 어떤 정점에서 나가는 간선(outgoing edge)의 수. - 위상 정렬(Topological sorting): 선수과목 구조처럼 보이게 DAG을 왼쪽에서 오른쪽으로 한 방향으로 죽 늘어 놓는 것. - 출발점에서 나가는 간선을 기준으로 부분문제를 만들 수도 있고 목적지로 들어오는 간선을 기준으로 부분문제를 만들 수도 있음 - 사이클이 있는 그래프에서 시간복잡도는 무한대임. - DAG의 경우 시간복잡도: O(V+E) - DP 쓰려면 부분 문제는 비순환이어야 한다.

34:49 The moment you stumble upon life-advice in part 19 of the programming lecture you've been watching.

This guy is a fantastic teacher with great humor.

the camera work is really good on this

Good job camera person. You're following the material and zooming in when relevant!

shortest paths 31:00

Is it weird that I have absolutely no idea what this class teaches, nor can I understand what it is trying to teach, yet I can't stop watching the lectures?

I love how he much he could do with his mind. I'm a theoretical physics major and computer science

Just leaving this here for someone to remind me in a couple of years, I regretted majoring in information systems instead of CS, and I cannot change my degree, but I will work hard and learn most of the needed stuff online in order to be able to learn more cs stuff on top of finishing my degree and getting a nice job that i enjoy in the future, through hard work and determination!

I love that he writes all of his code in python

Good talk. My sharpest criticism: I’ll bet he goes though a lot of chalk pressing as hard as he does.

Love this guy's handwriting.

I used to know all this in my past life. This is way beyond my comprehension. But a great teacher.

This video makes me wanna apply for MIT

Dynamic Programming AKA "Careful Brute Force" XDD I lost it. Sooo accurate

Great explanation. Thank you!

Awesome explanation. Thank you.

I'm looking at this now,same as I was looking at math class when I was a kid

The last remark that the algorithm can be modified to compute weights of shortest paths in graphs (possibly with cycles) was rushed a little bit. Can someone explain it in better terms? Thanks :)

Thank you for uploading this video.

I'm in love with this guy.. btw nice lecture..