Posted by: atri | November 9, 2011

Lect 30: Multiplication Algorithm

We studied the O(n^{\log_2{3}}) time algorithm to multiply two $n$-bit integers. I forgot to mention this in class– the algorithm is due to Karatsuba. The Wikipedia page on the algorithm has the interesting history on how the algorithm was discovered. We then started with the problem of counting the number of inversions, which we will continue on Friday. The material will be from Sec 5.3 in the textbook.

The slides have been uploaded.

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