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:


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s


%d bloggers like this: