Repeatedly swaps adjacent out-of-order elements.

Resolves hash collisions by finding another table position.

Describes a strict asymptotic lower bound.

Caching function results to avoid repeated computation.

Repeatedly selects the smallest remaining element.

Checks sequential positions after a hash collision.

Amount of computational time an algorithm requires.

Solving dynamic-programming problems using a table.

Builds a sorted sequence one element at a time.

Checks positions using quadratic offsets.