Question

a) You must write a recursive function that takes something of the form: ([(Int, Int, Int), Int, Int) as an argument and returns something of the form: LE(Int, Int, Int)]] which should be interpreted as a list of lists of 3-tuples of RGB values. You may use helper functions if you wish, but your solution must be recursive. You must document the name of your function at the beginning of your code using a comment like -- foo :: ([(Int, Int, Int)], Int, Int) -> [[(Int, Int, Int)]] -- foo is the function I have written to address requirement (a)

Answer 1

Without the context of the complete usage of function it is confusion as to what end the recursion is required. Though a sample script is being provided here. This script takes in a list along with a constant value and a list index. The function must recursively reduce the value of constant c from all the indexed location index in list between the very first i.e. '0' and the given value index.

#===============================================

def foo(list1,int1,int2):

if(int2>=0):

list1[int2]=list1[int2]-int1;

foo(list1,int1,int2-1); # Recursively reducing the index value and passing it on

return list1;

# Passing sample arguments

final_list = foo([1,2,3,4,5,6],6,2);

# Printing the returned values

print(final_list);

#===============================================

Output:

[-5, -4, -3, 4, 5, 6]

Hope this helps! PLEASE THUMBS UP!!!!!!!!!!!!!!!!!!!!!!!!

In case of any clarification, please comment!