Algorithms

Pages in this section

• Decision tree
  Last edited: 2026-02-05
  Decision tree

  Suppose you have two sets $A$ and $B$. A decision tree is a representation of a function $f: A \rightarrow B$, it is comprised of,

• Recursion
  Last edited: 2023-11-13

  This is the technique of a function calling itself recursively to find an answer and returning at some given condition. This is in opposition to Iterative algorithms that achieve what they want in a for or while loop.

  The important thing to remember is to set up a return condition that will always be met otherwise, this could go on forever (see Halting problem ).