Recursion

Method that calls itself. Must have two parts: a base case and a recursive call.

Binary Search

Requires data to be in sorted order to use.

The actual algorithm coninuously halvea data until the value is found

More efficient than linear search. In terms of Big O Notation, it is O(log2n) vs O(n).