A Boolean condition to determine which of two paths are taken in an algorithm or program.

The sequential execution of steps in an algorithm or code in a program (like steps in a recipe).

An algorithm that iterates through each item in a list until it finds the target value.

A run time for an algorithm that increases faster than a polynomial function, for example a superpolynomially (like 2^n2n2, start superscript, n, end superscript or n!n!n, !).

A run time for an algorithm that doesn't increase faster than a polynomial function of the input size (like 10n10n10, n, n^2n2n, squared, etc).

A technique that helps an algorithm find a good solution in a hard problem (like always walking toward the north star when you are stuck in a forest).

A problem that is so logically difficult, we can’t ever create an algorithm that would be able to answer "yes or "no" for all inputs (like the halting problem).

A collection of procedures that are useful in creating programs.

Application Programming Interface, a library of procedures and a description of how to call each procedure.

The separation of a program into independent modules that are each responsible for one aspect of the program's functionality.

The iteration over the items in a list.

An algorithm that searches a sorted list for a value by repeatedly splitting the list in half.