Tree - (Recursion|Induction) Algorithm

1 - About

A recursive algorithms invoke themselves as a subroutine with a smaller input.

The idea of the recursion tree method is to write out all of the work done by the recursive algorithm in a tree structure, with the children of a given node corresponding to the recursive calls made by that node.

See Mathematics - Logarithm Function (log)

3 - Base case

Recursive algorithms need a base case so they don't keep calling themselves until the rest of time. When the input's sufficient (small), you stop the recursion and you just return some trivial answer.

  • Bookmark "Tree - (Recursion|Induction) Algorithm" at del.icio.us
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at Digg
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at Ask
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at Google
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at StumbleUpon
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at Technorati
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at Live Bookmarks
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at Yahoo! Myweb
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at Facebook
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at Yahoo! Bookmarks
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at Twitter
  • Bookmark "Tree - (Recursion|Induction) Algorithm" at myAOL
tree/recursion.txt ยท Last modified: 2016/06/24 09:54 by gerardnico