Posted by: atri | November 2, 2011

Lect 27: Cut Property Lemma

In today’s lecture, we proved the cut property lemma. We then talked about the divide and conquer paradigm and the sorting problem. Next lecture, we will study the mergesort algorithm, which is from Section 5.1 in the textbook.

The slides have been uploaded.

Below are links to the student posts for the lecture:

Advertisements

Leave a Reply

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

WordPress.com Logo

You are commenting using your WordPress.com 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 )

Google+ photo

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

Connecting to %s

Categories

%d bloggers like this: