Lec 12 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

[lovelplants]

one of my fave teacher..

[RYLSKYY]

this guy explains it so awesomely and clearly. why can't all profs do this..

[lovelplants]

hmm, i guess i have to watch the previous videos because i can't catch up either..

[sarbasov]

I did not catch why he proved that additional helping linked list must be of root(n) size and then finally he shows additional helping linked list of n/2 size as ideal skip list? So finally what is better cardinality of skip list: root(n) or n/2?

[chessmani]

Real good stuff

[jayorca]

good lecture......

[davincihero]

he really meant subset; the second list stores a subset of the elements in L1

[Omoniyi2]

check the MIT videos on networking. You will find some OS/networking lectures intertwined, which is the best way to present these subjects, in my view.

[interted]

London has oldest subway

[allug4me]

can anyone plz point me to operating system video lectures by MIT. I searched a lot but couldn't find them :(

[babapua]

at 1:01:40 he says "are these equal ? no.... unless they are independent", I guess what he wanted to say is that they are equal if the probability that any two events occur at the same time is zero, i.e. P(E1 and E2 ) = 0 etc .... anyway, its a brilliant lecture, I love them all .

[babapua]

have you noticed the Freudian slip in the lecture ? at 0:16:00 ? when he writes subway but says subset ? kinda interesting how the brain works....

[daiphoenix]

@babapua Hehe, nice catch! I never came across a *written* Freudian slip before, instead of just a spoken one. Didn't even know those could happen. :p

[Kholrabi]

This professor rules.

[easter10]

yes, i love how he explains and seems like cool guy.