hey again

i ve learned about recrusion in python today and i ve been doing some exercises about it

and ive come across this one but sadly it had no solution with it in the pdf

this is what the exercise says

‘Write a function using recursion to print numbers from 0 to n’

and this is my answer

```
def print_numbers(n,k=0):
if n==k:
print(n)
else:
print(k)
return print_numbers(n,k+1)
print_numbers(5)
```

the code run with no problems but my question is ‘is this the most efficient and acceptable way’

thank you