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.
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
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.
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
I think it’s more helpful. Markers are harder to see and spontaneously stop working. You can tell if the chalk it about to stop working soon just by looking at the length of the chalk.
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.
The last house cannot have a smaller amount of bricks than the second to last, because the second to last house is special (by definition, neighbor on right of it has at least the same number of bricks). Thus, the last house will not fall down, as getting blown down requires the house on the right to have strictly less bricks. (At least that's how I interpreted this question)
one of the worst courses ever, doesnt truly explain it, just dishes out formulas and doesn't explain them thoroughly. students also don't question the prof, and just accepts it. terrible
In case you mean this video and not the full course... this video is just to go over the problem sets. This video is not an example of the lectures of the course. Here's the playlist for the lecture and problem set videos: th-cam.com/play/PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY.html. Also, there are non-video resources for this course on MIT OpenCourseWare at; ocw.mit.edu/6-006S20. In case you really mean the course course... sorry it didn't work for you. We do have another version of the course that might be of help (it has videos too): ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/. Best wishes on your studies!
This teacher is just a gift for MIT students and now for us all, great vibe, great problem sets ... thank you MIT
45:03 Problem 2
52:17 Problem 3
1:08:37 Problem 4
Justin is a one happy guy! Great session. Thank you Justin!
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.
The only algorithm teacher that bought smile to my face while learning .. Justin 😁😁 👍👍
Justin is so happy! which makes me happy. Thank you.
I love this teacher's vibe
50:13 Little Freudian slip there eh?
I love this Justin's character
Why are you zooming at 22:32 when he confronts his mistake? To emberess him!? 😂
State-of-the-art wolf brick-blowing pig analysis! LOL!
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.
I finally understood, thanks prof Solomon for explaining this easy...thanks MIT for sharing these courses.
feel like my mind is melting, FABULOUS
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
yeah makes sense
i agree with you
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
This guy is just too awesome
This lecture makes me smile!
I think I will never get bored of Solomon lectures
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.
We don't know where k is.
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
Its great to watch this. Awesome instructor.
It was quite funny and very well explained, thank you prof Solomon and MIT.
thank you for sharing this "fabulous" content ❤
1:09:37 82% OF HIS TIME MAKING A JOKE ABOUT THAT
Wait this is the graphics guy!?
There’s something ironically funny about the Massachusetts’s Institute of TECHNOLOGY still using chalkboards.
I think it’s more helpful. Markers are harder to see and spontaneously stop working. You can tell if the chalk it about to stop working soon just by looking at the length of the chalk.
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.
'all but one' means that there is only 1 'non-special' house, every other house is special.
The last house cannot have a smaller amount of bricks than the second to last, because the second to last house is special (by definition, neighbor on right of it has at least the same number of bricks). Thus, the last house will not fall down, as getting blown down requires the house on the right to have strictly less bricks.
(At least that's how I interpreted this question)
he is awesome!
17:30 sounds like he farted 😂
a happy fart
Love this guy!
goddd this guy is so cool... :) great session
What an exciting teacher!
"different way to skin the same cat.. is that a weird phrase? idk.. "
LOL
like the laugh
1:08:34
50:01
31:15 F WORD HAHAHA
folks
“All right folks”
one of the worst courses ever, doesnt truly explain it, just dishes out formulas and doesn't explain them thoroughly. students also don't question the prof, and just accepts it. terrible
In case you mean this video and not the full course... this video is just to go over the problem sets. This video is not an example of the lectures of the course. Here's the playlist for the lecture and problem set videos: th-cam.com/play/PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY.html. Also, there are non-video resources for this course on MIT OpenCourseWare at; ocw.mit.edu/6-006S20. In case you really mean the course course... sorry it didn't work for you. We do have another version of the course that might be of help (it has videos too): ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/. Best wishes on your studies!