24. Cache-Oblivious Algorithms: Searching & Sorting 

Thanks to instructors, TAs and MITOCW for those amazing courses!!!

This was an awesome class. Had a lot of fun watching lectures and doing assignments. Thanks to Erik, Srinivas, and MIT!

Proud to have reached the end of the course; Thank you so much

I watched the old course few years ago. I watched this one as well. I would watch it third and fourth time if you make it in next years. You are the two most awesome professors on planet. I wish you both the best in life :))

The true light of knowledge is transfered via frisbee throws. It was amazing, entertaining, eye opening and brain exercising. Thank you. to great instructors, TAs and ocw members involved in preparation.

0:20 - 13:00 review of both memory models from the previous lecture (external memory model & cache oblivious model) 13:00 - 36:20 searching (binary search on array, B tree - problematic because we are oblivious of the B constant => "Van Emde Boas") 37:25 - 1:01:20 sorting (inserting into B tree bad (/logB), binary mergesort much better (/B), M/B mergesort is the best) 1:01:20 - 1:08:00 which class to take next? :) 1:08:00 best guys ever

Professor Demaine is pretty awesome !! Great lectures by both the Profs.

Thank you for the course, it is very interesting

This guy is awesome!! Blows my mind!! 🤯

Please, where is the advanced Game Theory course he recommended at the end? Is it not just on the net yet, or wasn't given at all in the first place?

I am curious why in 45:42, the height is lgN - lgM rather than lg(N/B) - lg(M/B), although result is the same but a little confused.

when is the graduation date? can i attend now?

How many times can he wear that shirt before it's invalid ?