Skip to content

Instantly share code, notes, and snippets.

@Pro496951
Last active July 3, 2020 14:04
Show Gist options
  • Save Pro496951/8f697b796e1d1a65958f94beb767ea9e to your computer and use it in GitHub Desktop.
Save Pro496951/8f697b796e1d1a65958f94beb767ea9e to your computer and use it in GitHub Desktop.
This is a small gist about Recursion in python
# Definition OF Recusrsion
Recursion is a common mathematical and programming concept. It means that a function calls itself. This has the benefit of meaning that you can loop through data to reach a result.
The developer should be very careful with recursion as it can be quite easy to slip into writing a function which never terminates, or one that uses excess amounts of memory or processor power. However, when written correctly recursion can be a very efficient and mathematically-elegant approach to programming.
In this example, tri_recursion() is a function that we have defined to call itself ("recurse"). We use the k variable as the data, which decrements (-1) every time we recurse. The recursion ends when the condition is not greater than 0 (i.e. when it is 0).
To a new developer it can take some time to work out how exactly this works, best way to find out is by testing and modifying it.
Here"s An Example Code :
def tri_recursion(k):
if(k > 0):
result = k + tri_recursion(k - 1)
print(result)
else:
result = 0
return result
print("\n\nRecursion Example Results")
tri_recursion(6)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment