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

2 votes205 views1 answer
Hardest python questions
Python
0 vote274 views1 answer
Random module randint
Python
0 vote240 views2 answers
How to split string with comma in python
Python
0 vote227 views1 answer
Read a number Print Fibonacci sequence up to the given number Python
Python
2 votes307 views1 answer
How to return images in flask response?
Python Flask
0 vote241 views1 answer
"DjangoJSONEncoder" is not defined
Python
59 votes226 views6 answers
How to get current date and time in python
Python
0 vote222 views1 answer
Python to c++ compiler
Python
0 vote229 views1 answer
Download csv file from jupyter notebook
Python
3 votes190 views2 answers
Plot bounds python
Python