 Once the numbers are computed, we need to add them together (steps 4 and 5), which takes about "n" operations.Karatsuba multiplication has a time complexity of O("n"log23) ≈ O("n"1.585), making this method significantly faster than long multiplication.Because of the overhead of recursion, Karatsuba's multiplication is slower than long multiplication for small values of "n"; typical implementations therefore switch to long multiplication for small values of "n".