 Karatsuba's algorithm was the first known algorithm for multiplication that is asymptotically faster than long multiplication, and can thus be viewed as the starting point for the theory of fast multiplications.In 1963, Peter Ungar suggested setting "m" to "i" to obtain a similar reduction in the complex multiplication algorithm.To multiply ("a" + "b i") · ("c" + "d i"), follow these steps