Question

Give python code for this algorithm in two ways. 1 Method has to be recursive, Method 2 has to use list comprehensions or list traversal methods.

You have to write python function that will be in this form ArithmeticSequence(0,2,10){} where 0 is the first number in the sequence, the next number goes up by 2, and stopping at the last value in sequence before 10, so 10 is the max of this sequence.

it has to pass a test like this ArithmeticSequence(0,2,10)== [0,2,4,6,8,10] where the outputted array starts at 0, and each additional element is added 2 to it until it stops at 10. Two methods, one recursive and the other one uses list methods.

Answer 1

Thanks for posting the question, here are the two functions that returns a lists using recursion and the other one using list comprehension

__________________________________________________________________________________________________

num_list=[]
def ArithmeticSequenceRecursive(start_num, increment,last_num):
    if start_num<=last_num:
        num_list.append(start_num)
        start_num+=increment
        ArithmeticSequenceRecursive(start_num,increment,last_num)
    return num_list

print(ArithmeticSequenceRecursive(0,2,10))

def ArithmeticSequenceComprehension(start_num,increment,last_num):
    return [num for num in range(start_num,last_num+1,increment)]

print(ArithmeticSequenceComprehension(0,2,10))

__________________________________________________________________________________________________

image screenshot

Thank You !!