Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020)

MIT 6.006 Introduction to Algorithms, Spring 2020
Instructor: Justin Solomon

Four examples of worked problems are given. These fous on solving recurrences and the Master Theorem.

License: Creative Commons BY-NC-SA

[utsavdave]

45:03 Problem 2
52:17 Problem 3
1:08:37 Problem 4

[oussamamegouas]

This teacher is just a gift for MIT students and now for us all, great vibe, great problem sets ... thank you MIT

[sungjuyea]

The reason for 34:59 is in CLRS book(ch 4.6.). The proof of the theorem uses big theta, and it looks perfectly fine to replace it with big O.

[jaggis]

Justin is a one happy guy! Great session. Thank you Justin!

[nithinkzy]

The only algorithm teacher that bought smile to my face while learning .. Justin 😁😁 👍👍

[reginaphalange]

Justin is so happy! which makes me happy. Thank you.

[scottdialo]

I finally understood, thanks prof Solomon for explaining this easy...thanks MIT for sharing these courses.

[patientson]

Lol. This brother speaks in riddles. Wait till you get your results and see him tell you why you failed or got it right. All the professors in this course are cosmic gifts.

feel like my mind is melting, FABULOUS

[ahkTuts]

How did no one react to his first joke when he was talking about the things they "learned last week"? like infinity stones and stuff? they were truly not paying attention and thats why he said that the class didnt seem interactive xDDD

[Mehmet-kudc]

51:15 I think it should be 2^m-1 < k ≤ 2^m
If 2^m-1 ≤ k then it wouldn't go to 2^m
Correct me if I am wrong

[neel_artstrong]

Why are you zooming at 22:32 when he confronts his mistake? To emberess him!? 😂

[JosephCaburnay]

State-of-the-art wolf brick-blowing pig analysis! LOL!

[hitaishibarai]

48:30 This question about finding planets with the index K. Provided that the key indices are not duplicate can't we simply take left as 1 and right as K. since we know that the K key will never to at an index greater than K.

[Anubis]

I think I will never get bored of Solomon lectures

Its great to watch this. Awesome instructor.

[dankal]

Its very hard to understand yet solve the problem around 56:00. What is document, image, what is x, y, what sorting they are talking about? Are the images same size? How one sorts images, like wtf? xD
There must be some information in the notes people have but not being said aloud

[Karim-nqbe]

It was quite funny and very well explained, thank you prof Solomon and MIT.

[hung-tienhuang]

At 1:18:47, wouldn't the last house also be special because is is a house that has no easterly neighbor? Therefore, the sequence actually have two special houses instead of all but one. Maybe my understanding to all but one is wrong.

[programminglover]

goddd this guy is so cool... :) great session