Posted by: atri | November 12, 2012

Lect 30: Solving Recurrences

In today’s lecture, we saw how to solve the recurrence relation for the runtime of the Merge Sort algorithm. This material was from Section 5.1 in the book (and more stuff in Section 5.2 is a reading assignment). We then started with the problem of multiplying two large numbers and we will continue with that in the next lecture. The latter stuff is from Section 5.5 in the book.

The slides and notes have been uploaded.


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: