Posted by: atri | November 13, 2010

## Lect 31: Mergesort algorithm

In today’s lecture we gave two proofs of the fact that the runtime of the mergesort algorithm is $O(n\log{n})$. The slides have been uploaded.

Next lecture, we will consider the problem of multiplying two integers. This material is from Sec 5.5 in the book.

Also a gentle reminder that Jeff will be talking more about recurrences in his recitations next week.

Below are the student blog posts for the lecture: