Lec 7 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005
Top Comments
All Comments (15)
-
@TheTharinduTube Hash-function can not be one-to-one since domain of hash function is greater than range. Pigeonhole principle is taking place.
-
someone please tell me why don't we choose a one-to-one hash function as there will be no collisions if we do so.. ???
-
i wish i had so good profs:(:( .....man i have becum fan of a bald guy n a ponytail guy(well not precisely a ponytail bt anyways) ;)
-
I love this lectures , Please keep on doing the good work , I'm improving my algorithms skills and I really admire and appreciate these very helpful and rare guidances by the most skilled professors of the world . I would definitely contribute back once for sure :)
-
Leiserson's attitude is "Deal with it." Demaine's seems to be "Yes, I know this is hard, let's work through it."
I imagine Leiserson grinning evilly and making up those brutal Quiz 2 questions and Demaine trying to think of ways to grade students answers as correct.
-
He is one of the author of the book Introduction to Algorithms...So he is also very good researcher....wonderful
-
I think both teachers are great. This is one of the best online lecture series I've seen (and I've seen a few). Notice that if you close your eyes, this guy sounds very much like G.W. Bush? Amusing to imagine the former president as a MIT professor :)
-
this professor rocks. He explains everything so clearly. He seems like he is a bit nervous as well. :)
-
great class, I liked that he didn't assume you remember every little mathematical fact. it was a great complement to my courses.
open course ware rules!
Hilariousity 3 years ago 25
I like this Professor, he's not pompous and doesnt get carried away with his position.
ThunderAppeal 3 years ago 12