The basic idea of this algorithm is to multiply the multiplicand by each digit of the multiplier and then add up all the properly shifted results. It's complexity is O(n^2), where n is the maximum ...