Question: Given two n-bit numbers a, b, computes a * b in time O(n^1.1). Now a and b are kn-bit, design an algorithm that computes a
Given two n-bit numbers a, b, computes a * b in time O(n^1.1). Now a and b are kn-bit, design an algorithm that computes a * b in time O(kn^1.1 ). Explain why the algorithm is correct, and prove the guarantee on the runtime.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
