hi im new to recursion and i was just wondering if someone could just step through how this bit of code gets the outcome that it does....
public static int mult(int m, int n)
{
//precondition m,n >=0
//postcondition: the method has returned the product of m and n
if (m==0) return 0;
else return mult(m/2, n*2) + (m%2) * n;
thanks