Recursion Recursive algorithms

Recursion in C recursion No base case implies an infinite recursion If a function doesn't have a base case, it will keeping making a recursive function call infinitely, recursion Recursion is a common technique used in divide and conquer algorithms The most common example of this is the Merge Sort, which recursively divides an array

recursion Recursion uses more memory In a computer, a function call is added to the “call stack” and stays there until it returns a value A recursive