Posted by: atri | November 18, 2010

Lect 33: Counting Inversions

In today’s lecture, we finished the divide and conquer algorithm for the integer multiplication problem and then moved on to the problem of counting the number of inversions. The slides have been uploaded.

Next lecture, we will finish up the algorithm for counting the number of inversions and start off with the problem of computing the closest pair of points in 2-dimensional space. These topics will be from Sec 5.3 and 5.4 respectively.

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