Amount of memory an algorithm requires.

Exploring choices and undoing unsuccessful choices.

Divide-and-conquer sorting algorithm using merging.

Uses another hash function for collision resolution.

Resource usage under the worst input.

Searches solutions while eliminating poor candidates.

Sorting algorithm based on partitioning around a pivot.

Ratio of stored entries to hash-table capacity.

Resource usage under the best input.

Exhaustively tries possible solutions.