Posted by: atri | November 11, 2010

Lect 30: Divide and Conquer

In today’s lecture we started with the divide and conquer paradigm. We looked at the sorting problem and quickly went over some \Theta(n^2) time sorting algorithms. Then we began with the merge sort algorithm. The slides have been uploaded.

Next lecture, we will analyze the run time of the merge sort algorithm, which will lead us to solving recurrences. The material will be from Sec 5.1 in the book.

Below are links to the student 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: