Question

Python Please

Write a recursive function rPatt that, when given a power of 2 as an argument, returns the patterns indicated in the examples.

OutPut:

>>> rPatt(1)
'|'
>>> rPatt(2)
'|--|'
>>> rPatt(4)
'|--|----|--|'
>>> rPatt(8)
'|--|----|--|--------|--|----|--|'
>>> rPatt(16)
'|--|----|--|--------|--|----|--|----------------|--|----|--|--------|--|----|--|'
>>> rPatt(32)
'|--|----|--|--------|--|----|--|----------------|--|----|--|--------|--|----|--|--------------------------------|--|----|--|--------|--|----|--|----------------|--|----|--|--------|--|----|--|'
>>>

Answer 1

def rPatt(n):
if n<=1:
print(end='|')
return
rPatt(int(n/2))
for i in range(n):
print(end='-')
rPatt(int(n/2))
n = int(input("Enter a number in powers of 2:"))
rPatt(n)

//PLS give a thumbs up if you find this helpful, it helps me alot, thanks.

//if you have any doubts, ask me in the comments