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

[steveeliasbelabbas]

do u learn this in unni

[RemonaJulenedt139]

lool ich bin nackt

[agapitoflores001]

MIT vids are great!

[complexgene]

great lecture!! Thank u professor...

[MrTweetbook]

phewww.......now i understand why no. of views keep going down with each passing lecture!!!!!!!!!!

[pankajkumar555]

0:02:25 that girl is always late for class .

[Snootwaller]

@santiclaus2 why do you say radix sort is not O(n) ? if you double the length of the input does that not double the workload? It seems intuitively obvious to me that the radix sort works in linear time. Looking forward to your response.

[BlueWaffleMan9000]

wow the students are so disrespectful i would kill to go to MIT but it seems like they don't give 2 shits

[santiclaus2]

Well, he talks good. A pity that what he says is not true......Radix Sort behaves NOT linear with n. It only seems so. Amazing that teachers like that didn't think only a little bit about what they say....

[w5181c]

this is so great for me

[veezbokumar]

people should speak up in the class

[blackout8787]

counting sort 34:16

[barcode9588]

Man, he explains this so much better than my prof.

[shiv093tube]

how weired ... who did this video.... no proper orientation of camera!!!(while explaining counting sort).. it simply sucked up!!!! bastards

[dewinmoonl]

HIGH QUALITY LECTURE!!!

[physnick]

I believe he is referring to Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest, and Stein, the textbook for the course

[DamirDiz]

@physnick i think so too

[johnangelo2000]

Which book is he referring to get all the proofs?