Essential Algorithms, 2nd Edition

Glossary

2-node

 — In a 2-3 tree, a node that has two children.

3-node

 — In a 2-3 tree, a node that has three children.

2-3 tree

 — A balanced tree structure where every internal node has either two children or three children.

A

accepting state

 — A state that makes a finite automaton accept its input if it finishes reading the input while in that state.

adaptive quadrature

 — A technique in which a program detects areas where its approximation method may produce large errors and then refines its method in those areas.

adjacent

 — Said of two nodes that are connected by a link.

Advanced Encryption Standard (AES)

 — A symmetric-key encryption algorithm that uses a substitution-permutation network.

adversary

 — In cryptography, a person trying to intercept and decipher a message sent by a sender to a receiver.

algorithm

 — A recipe for getting something done.

amortized analysis

 — Analysis of an algorithm's time, memory use, or other measures over a period of time rather than in the worst case.

ancestor

 — In a tree, a node's parent, its parent's parent, and so on, to the root node.

array

 — A chunk of contiguous memory that a program can access by using indices—one index per dimension in the array.

associative array

 — See hash table.

asymptotic performance

 — The limit of an algorithm's performance as the problem size grows very large.

attacker

 — In cryptography, a person trying to intercept and decipher a message sent by a sender to a receiver.

augmenting path

 — A path ...