Write a recursive function that accepts two arguments into the parameters x and y. The function should return the value of x times y. Hint: multiplication can be performed as repeated addition. Test your recursive function by prompting the user to enter values for x and y and then displaying the result. Your function should be able to handle multiplication of negative values.

In Python:

def times(x,y):

     if y<0:

           return -1*times(x,y*-1)

     if y == 1:

           return x

     return x + times(x,y-1)

x = int(input("x: "))

y = int(input("y: "))

print(times(x,y))

Explanation:

I answered the question using Python3

This defines the function

def times(x,y):

This checks for negative values

     if y<0:

           return -1*times(x,y*-1)

This is the base case where y = 1

     if y == 1:

If true, the value of x is returned

           return x

This returns the recursion and it is repeated until the base case is achieved

     return x + times(x,y-1)

This prompts user for x value

x = int(input("x: "))

This prompts user for y value

y = int(input("y: "))

This calls the recursion and also prints the result

print(times(x,y))

answer; i do believe its (faster);