Question: Problem 1: Give an algorithm to multiply two decimal numbers, each N digits long. You may assume a linear-time addition algorithm is available (from the

Problem 1: Give an algorithm to multiply two decimal numbers, each N digits long. You may assume a linear-time addition algorithm is available (from the previous assignment), and that you have a constant-time algorithm to multiply two single digits obtaining a two-digit result. Prove your algorithm's correctness, and analyze its runtime. For full credit, your algorithm should have at most a O(N2) runtime. D
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
