Recursive Pattern Using Python

Question

Recursive Pattern

Description Given a positive integer 'n' and another positive integer 'k' (<n),  print the following pattern using recursion.

Example:
Input 1: n = 12, k = 5
Output 2: 12, 7, 2, -3, 2, 7, 12

Input 2: n = 10, k =2
Output 2: 10, 8, 6, 4, 2, 0, 2, 4, 6, 8, 10

Basically, you need to keep decrementing the given value of 'n' by 'k' until you encounter 0 or a negative number, in which case, you need to start incrementing by 'k' until you reach 'n' again.

Format:
Input: The first line contains the positive integer 'n'. The second line contains the positive integer 'k'.
Output: The required pattern as comma-separated-values as shown in the examples above.

Answer 1

n = int(input("please enter your no:"))
k = int(input("please enter ypur no:"))
m = []
for i in range(0,n*2+k,k):
    if n-i >= 0:
        a = n-i
        m.append(a)
    elif n-i < 0:
        a = n-i
        a = a + a*-2
        m.append(a)
for i in m:
    print(i,end=",")

Answer 2

# Reading the input
n = int(input())
k = int(input())

# Define the function
def pattern(n, m, k):
    
    # Base case. If m <= 0, print m and return from the function
    if m <= 0:
        print(m, end = ", ")
        return
    
    # Print m, call the recursive function with (n, m-k, k), and then print m again
    print(m, end = ", ")
    pattern(n, m-k, k)
    # This conditional statement has been used so that you do not print a comma
    # after the last element.
    if(n != m):
        print(m, end = ", ")
    else:
        print(m)

# Declaring another variable m equal to n
m = n

# Calling the function with 3 arguments - n, m, and k. The extra m will be used
# for recursive calls. The n will be preserved because if you check the output
# format, you will see that after the last element, you shouldn't print a comma.
# The value of 'n' in the function will be used primarily for that.
pattern(n, m, k)