Lec 5 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005
Top Comments
All Comments (21)
-
do u learn this in unni
-
lool ich bin nackt
-
MIT vids are great!
-
great lecture!! Thank u professor...
-
phewww.......now i understand why no. of views keep going down with each passing lecture!!!!!!!!!!
-
0:02:25 that girl is always late for class .
-
@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.
-
wow the students are so disrespectful i would kill to go to MIT but it seems like they don't give 2 shits
-
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....



Man, he explains this so much better than my prof.
barcode9588 2 years ago 14
HIGH QUALITY LECTURE!!!
dewinmoonl 2 years ago 10