Lec 12 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005
Loading...
Top Comments
All Comments (15)
-
one of my fave teacher..
-
this guy explains it so awesomely and clearly. why can't all profs do this..
-
hmm, i guess i have to watch the previous videos because i can't catch up either..
-
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?
-
Real good stuff
-
good lecture......
-
he really meant subset; the second list stores a subset of the elements in L1
-
@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
-
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.
-
London has oldest subway
23 videosMIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),- 1:19:06
Lec 13 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT14,250 views
- 1:11:00
Lec 15 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT36,143 views
- 1:23:51
Lec 10 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT21,072 views
- 38:33
Lec 12 | MIT 6.189 Multicore Programming Primer, IAP 2007by MIT1,599 views
- 50:16
Lec 8 | MIT 5.112 Principles of Chemical Science, Fall 2005by MIT213,459 views
- 1:49
worst professor everby ugod355399,203 views
- 1:21:22
Lec 9 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT18,818 views
- 1:20:33
Lec 4 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT47,573 views
- 59:25
Session 1 | 21F.223 Listening, Speaking, and Pronunciationby MIT508,963 views
- 1:19:47
Lec 8 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT18,346 views
- 1:17:07
Lec 2 | MIT 6.189 Multicore Programming Primer, IAP 2007by MIT20,509 views
- 50:25
Lec 15 | MIT 6.00 Introduction to Computer Science and Programming, Fall 2008by MIT22,690 views
- 1:19:29
Unit 2: Compression, Lecture 1 | MIT 6.050J Information and Entropy, Spring 2008by MIT2,291 views
- 50:23
Lec 12 | MIT 6.033 Computer System Engineering, Spring 2005by MIT5,820 views
- 1:19:35
Lec 22 | MIT 6.451 Principles of Digital Communication IIby MIT3,342 views
- 1:17:40
Lec 7 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT30,539 views
- 49:11
Lecture - 13 Treesby nptelhrd28,833 views
- 1:01:23
Lecture - 5 Hashingby nptelhrd67,344 views
- 57:48
Lec 17 | MIT 6.189 Multicore Programming Primer, IAP 2007by MIT3,324 views
- 51:44
Lec 22 | MIT 6.033 Computer System Engineering, Spring 2005by MIT6,670 views
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....
babapua 2 years ago 3
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 2 years ago 2