Review

We saw two multiplication algorithms.

• ``Naive'' implemented multiplication by successive addition.
• ``Russian'' implemented multiplication by a base-2 version of the standard grade school multiplication algorithm.

A simple experiment suggested that the time it takes to multiply a by itself

• using Naive is some linear function of a,
• using Russian is some logarithmic function of a.

As a result, it appears Russian outperform Naive on large problems.