1. Recursion

• to be short, it's when a method calls itself
• It MUST have base cases
• Each recursive call should make progress towards a base case

2. Linear/Binary/Multiple Recursion

Linear Recursion

• It may has some statements taht decide which of several possible rcursive calls to make

• But it should ultimately make just one of these calls

• You sometimes need to define some arguments to make the method recursive

• Linear sum(from a to b), Reversing an array

• Tail recursion : when a linearly recursive method makes its recursive call as its last step

  • it can be easily converted to non-recursive methods(loops)

Binary Recursion

• It makes two recursive calls

Multiple Recursion

• It maeks more than two recursive calls
  • if the function is called in a loop, it'd be a multiple recursion

3. Implementation