Posted by: atri | November 28, 2010

Lect 35: Divide and Conquer Algorithm for Closest Pair

(Sorry for the delay in posting this entry.)

On Monday, Jeff finished the divide and conquer based algorithm for computing the closest pair of points in 2-D. The slides have been uploaded.

In the next lecture, we will start with the dynamic programming paradigm. This material will be from Sec 6.1 in the book.

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