Compute the nth Fibonacci number without redundantly recalculating the same sub-values.
Compute n factorial (n x (n-1) x ... x 1) using recursion.
Compute x raised to the power n efficiently by squaring halves instead of multiplying one at a time.
Generate every possible subset of a list of elements (the power set).