Recursion

int function(int value) {
   if(value < 1)
      return;
   function(value - 1);

   printf("%d ",value);   
}

Source: tutorialspoint.com

Recursion

def foo():
	foo()

Recursion

def recursive_function(parameters):
    if base_case_condition(parameters):
        return base_case_value
    recursive_function(modified_parameters)

Recursion

function loop(x) {
  if (x >= 10) // "x >= 10" is the exit condition (equivalent to "!(x < 10)")
    return;
  // do stuff
  loop(x + 1); // the recursive call
}
loop(0);

Source: developer.mozilla.org

Recursion

def is_divisible(x, y):
    if x % y == 0:
        return True
    else:
        return False

def is_power(a, b):
    if a == 1 or b == 1:                           # a more succinct way to test base case
        return a == 1  
    return is_divisible(a, b) and is_power(a/b, b) # divisible and recursions report True?

Source: stackoverflow.com

Recursion

function multiply(arr, n) {
    if (n <= 0) {
      return 1;
    } else {
      return multiply(arr, n - 1) * arr[n - 1];
    }
  }

Source: freecodecamp.org

Recursion

#https://github.com/aspittel/coding-cheat-sheets/blob/master/fundamentals/recursion.md

def factorial(n):
	if n <= 1:
		return 1
	return n * factorial(n - 1)

# Memoization
# Memoization is often useful in recursion. This is when the results of a function call are remembered so they can be used again in later function calls. This is like caching your results to use again.

# Code Example

factorial_memo = {}

def factorial(n):
	if n <= 1:
		return 1
	elif n not in factorial_memo:
		factorial_memo[n] = n * factorial(n-1)
	return factorial_memo[n]
# Tail Recursion
# Tail recursion is where calculations are performed first and then the recursive call is executed. Some programming languages, usually functional ones, optimize tail calls so they take up less room on the call stack.

def factorial(n, running_total=1):
	if n <= 1:
		return running_total
	return factorial(n-1, n * running_total)

Recursion

def recursion():
  reursion()

Recursion

See Recursion.

Recursion

-1

Similar codes

1 vote145 views2 answers
Split a string with 2 char each in python
Python
3 votes157 views2 answers
Button images in tkinter
Python
0 vote137 views2 answers
Logger
Python
0 vote142 views1 answer
If number Of Players == >=4 python
Python
3 votes189 views1 answer
Python add legend title
Python
0 vote145 views1 answer
OfficeApi
Python
5 votes173 views1 answer
Get index in foreach py
Python
1 vote142 views2 answers
Converting an array to linked List
Python
9 votes162 views5 answers
Pandas see all columns
Python
1 vote151 views1 answer
Dataframe sort values descending
Python