Posted by: atri | November 16, 2012

Lect 32: Counting Inversions

In today’s lecture, we covered the divide and conquer algorithm to count the number of inversions. This material is from Section 5.3 in the textbook. On Monday, we will start with the problem of computing the closest pair of points on the plane. This material is from Section 5.4 in the book.

The slides and notes have been uploaded.

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: