Map preserving a defined ordering of keys.

Technique solving overlapping subproblems and storing results.

Heap where the smallest element has highest priority.

Graph representation using a matrix of connections.

Object or mechanism used to traverse elements.

Algorithmic technique exploring possibilities and undoing choices.

Heap where the largest element has highest priority.

Data structure mapping keys to values using hashing.

Construct that produces values incrementally.

Method systematically trying possible solutions.