Index

0.4.1 Graph Representation

addition chaining

0.5.7 Addition Chaining

adjacency list

adjacency matrix

0.4.1 Graph Representation

adjacent nodes

0.10 Data Compression Algorithms | 0.10.1 Run-Length Encoding

algorithm

Euclid's: 0.5.6.1 Source Code
greedy: 0.4.4 Dijkstra's Algorithm -

almost sorted

0.3.1.4 Improvement Strategies | 0.3.5 Insertion Sort | 0.3.6 Shellsort

ASCII

b+-tree

0.2.5 B+-Trees

balanced binary tree

balanced tree

banker's algorithm

0.3.4 Benchmarking the Quicksort

benchmarking

bernoulli model

binary search

0.2.1 Linear Search | 0.2.2 Binary Search | 0.2.3 Binary Search Trees

binary search tree

binary squares and multiply

0.5.7.1 Source Code

binary tree

black depth

block-block

0.2.6 Boyer-Moore String Searching

boyer-moore

breadth-first traversal

0.4.2.2 Breadth-first traversal

brute force

0.2.1 Linear Search

BST

0.5.9 Cartesian and Polar

bubble sort

0.3.7.1 Analysis | 0.3.8 Bubble Sort

bucket sort

0.3.9 Bucket and Radix

byte

flag: 0.10.5 Sliding Window Compression

Caesar

Julius: 0.5.5.1 A Brief History

Caesar, Julius

0.5.5.1 A Brief History

calendar

Gregorian: 0.5.5 Julian Calendar Algorithms | 0.5.5.1 A Brief History
Julian: 0.5.5 Julian Calendar Algorithms

Cartesian

CCIT

0.12.3.1 CRC-CCIT

chaining

addition: 0.5.7 Addition Chaining

chaining variables

0.12.1 Checksums | 0.12.3 Cyclic Redundancy Checks

checksum

weighted: 0.12.1 Checksums | 0.12.3 Cyclic Redundancy Checks

child node

0.2.3 Binary Search Trees | 0.3.3 Heapsort

circuit

0.4.5 Spanning Trees

Hamilton: 0.4.2.4 Hamilton Circuits

circular wait

claim

class

equivalence: 0.4.5.2 Kruskal's Algorithm

closed hashing

clusters

codes

compression: 0.10.5 Sliding Window Compression
delta: 0.10.2 Integer Coding
dictionary: 0.10.5 Sliding Window Compression
Elias: 0.10.2 Integer Coding
Gamma: 0.10.2 Integer Coding
Golomb: 0.10.2 Integer Coding
prefix: 0.10.5 Sliding Window Compression

coding

integer: 0.10.2 Integer Coding
recurrence: 0.10.1 Run-Length Encoding

collision

color-flip

comparison based sorting

0.2.7.1 Selecting a Hash | 0.2.7.5 One-way hashing

complete tree

0.3.3 Heapsort

compression

adaptive: 0.10 Data Compression Algorithms
data: 0.10 Data Compression Algorithms
dynamic: 0.10 Data Compression Algorithms
Huffman: 0.10.3 Huffman Compression
Lempel-Ziv: 0.10.5 Sliding Window Compression
sliding window: 0.10.5 Sliding Window Compression
static: 0.10 Data Compression Algorithms

compression function

convex hull

0.8.1 Convex Hull Problem

coordinates

Cartesian: 0.5.9 Cartesian and Polar
polar: 0.5.9 Cartesian and Polar

CRC

CCIT: 0.12.3.1 CRC-CCIT

cycle

Euler: 0.4.2.3 Euler Cycles

cyclic redundancy check

data clumping

data clusters

data compression

0.10.1 Run-Length Encoding

DCT

deadlock

avoidance: 0.7.1 Dijkstra's Banker's Algorithm

deadly embrace

decoding

0.2.3 Binary Search Trees | 0.2.4 Red-Black Trees

degenerate binary search tree

delta codes

0.4.3 Floyd's Algorithm -

dense graph

depth-first traversal

0.4.2.1 Depth-first traversal

di-graph

dictionary codes

dictionary-based

Dijkstra

0.4.3 Floyd's Algorithm - | 0.4.4 Dijkstra's Algorithm -

Dijkstra's algorithm

diminishing increment sort

0.3.6 Shellsort

directed graph

distinct

division method

dualhashing

dynamic

dynamic programming

0.8.4 Knapsack Problem

edge

Elias codes

encoding

run-length: 0.10.1 Run-Length Encoding | 0.10.5 Sliding Window Compression

ensemble

0.4.5.2 Kruskal's Algorithm

equivalence class

Euclid's algorithm

Euler

Euler cycle

Euler's constant

expression

0.6.3 Samuelson-Bauer xpression analysis

Fibonacci

0.5.8 Fibonacci Calculation

FIFO

0.4.2.2 Breadth-first traversal

fingerprint

digital: 0.2.7.5 One-way hashing

flag byte

0.4.3 Floyd's Algorithm - | 0.4.4 Dijkstra's Algorithm -

Floyd's algorithm

force

brute: 0.2.1 Linear Search

function

compression: 0.2.7.1 Selecting a Hash | 0.2.7.5 One-way hashing

fuzzy search

0.5.10 Soundex English word-sounding

Gamma codes

GCD

generator

pseudo-random number: 0.5.12 A Pseudo-Random Number

Golomb codes

graph

dense: 0.4.3 Floyd's Algorithm -
directed: 0.4 Graph Algorithms
edge: 0.4 Graph Algorithms
node: 0.4 Graph Algorithms
sparce: 0.4.1 Graph Representation
vertex: 0.4 Graph Algorithms
weighted: 0.4 Graph Algorithms | 0.4.5 Spanning Trees

greatest common divisor

0.4.4 Dijkstra's Algorithm -

greedy algorithm

Gregorian calendar

0.5.5 Julian Calendar Algorithms | 0.5.5.1 A Brief History

Gregory XIII

Pope: 0.5.5.1 A Brief History

Hamilton circuit

0.4.2.4 Hamilton Circuits

hash

closed hashing: 0.2.7.2 Dealing with Collisions
dualhashing: 0.2.7.2 Dealing with Collisions
linear probing: 0.2.7.2 Dealing with Collisions
one-way: 0.2.7.5 One-way hashing
open hashing: 0.2.7.2 Dealing with Collisions
quadratic probing: 0.2.7.2 Dealing with Collisions
random probing: 0.2.7.2 Dealing with Collisions
rehashing: 0.2.7.2 Dealing with Collisions
table-size: 0.2.7.3 Choosing a Table
uniform hash function: 0.2.7.1 Selecting a Hash

hash function

hash table

0.2.7 Hashing | 0.2.9 Tries

hash value

hash-table size

0.2.7.3 Choosing a Table

hashing

closed: 0.2.7.2 Dealing with Collisions
open: 0.2.7.2 Dealing with Collisions

heap

0.3.3 Heapsort | 0.4.5.2 Kruskal's Algorithm

heapify

0.3.3.4 Analysis

heapsort

0.3.3 Heapsort | 0.4.5.2 Kruskal's Algorithm

Hoare, C.A.R

0.3.1 The Quicksort

hold and wait

homogeneous sets

Huffman coding

0.2.9 Tries

Huffman compression

0.2.9 Tries | 0.10.3 Huffman Compression

Huffman tree

0.2.9 Tries | 0.10.3 Huffman Compression

hull

convex: 0.8.1 Convex Hull Problem

i-node

0.2.5 B+-Trees

improvement

Quicksort: 0.3.1.4 Improvement Strategies

improvements

mergesort: 0.3.2.2 Improvements

index node

0.2.5 B+-Trees

insertion sort

0.3.5 Insertion Sort

integer coding

0.3.3.1 Building a Max-Heap

internal node

internal nodes

0.10.1 Run-Length Encoding

JPEG

Julian calendar

0.5.5 Julian Calendar Algorithms

Julius

Caesar: 0.5.5.1 A Brief History

Julius Caesar

0.5.5.1 A Brief History

key value

0.4.5.2 Kruskal's Algorithm

knapsack problem

0.8.4 Knapsack Problem

Kruskal's algorithm

LCM

leaf nodes

least common multiple

Lempel

Abraham: 0.10.5 Sliding Window Compression

linear probing

linear search

0.2.1 Linear Search | 0.2.2.1 Analysis

linked list

0.2.2.1 Analysis | 0.4.1 Graph Representation

linked-list

0.2.3 Binary Search Trees | 0.2.7.2 Dealing with Collisions | 0.3.2.1 Analysis

list

adjacency: 0.4.1 Graph Representation
linked: 0.2.2.1 Analysis

lossless

lossy

0.5.1 Maximum Consecutive Subsequence

matrix

0.4.1 Graph Representation | 0.4.3 Floyd's Algorithm - | 0.10.1 Run-Length Encoding

max-heap

0.3.3 Heapsort

maximum consecutive subsequence

MD5

0.5.11 Metaphone Algorithm

median

0.2.2 Binary Search | 0.3.1.1 Picking a Pivot | 0.3.10 The nth Largest

Mergesort

0.3.2 The Mergesort

improvements: 0.3.2.2 Improvements

metaphone algorithm

method

division: 0.2.7.1 Selecting a Hash
multiplication: 0.2.7.1 Selecting a Hash

min-heap

0.3.3 Heapsort | 0.4.5.2 Kruskal's Algorithm

multipilcation method

0.2.3 Binary Search Trees | 0.4 Graph Algorithms

node

child: 0.2.3 Binary Search Trees
index: 0.2.5 B+-Trees
parent: 0.2.3 Binary Search Trees
root: 0.2.3 Binary Search Trees | 0.4.5 Spanning Trees
sibling: 0.2.3 Binary Search Trees

nodes

adjacent: 0.4 Graph Algorithms

non-comparison based sorting

0.3.3.1 Building a Max-Heap

non-leaf node

non-preemptive allocation

non-sharable

nth largest

0.3.10 The nth Largest

numbers

pseudo-random: 0.5.12 A Pseudo-Random Number

octree

open hashing

0.5.10 Soundex English word-sounding | 0.5.11 Metaphone Algorithm

parent node

0.2.3 Binary Search Trees | 0.3.3 Heapsort

partition

0.3.1 The Quicksort | 0.3.1.2 Partitioning

phonetic search

picnic basket problem

0.8.4 Knapsack Problem

pivot point

0.3.1 The Quicksort

pivot value

0.3.1 The Quicksort

point

pivot: 0.3.1 The Quicksort

polar

0.5.9 Cartesian and Polar

polynomial

divisor: 0.12.3 Cyclic Redundancy Checks

Pope

Gregory XIII: 0.5.5.1 A Brief History

pre-image

pre-text

prefix code

0.5.12 A Pseudo-Random Number

Prim's algorithm

0.4.5.1 Prim's Algorithm

programming

dynamic: 0.8.4 Knapsack Problem

pseudo-random numbers

push-down

0.3.3.4 Analysis

quadratic probing

quadtree

0.4.2.2 Breadth-first traversal

queue

Quicksort

0.3.1 The Quicksort | 0.3.10.2 Modified Quicksort

Quicksort improvement

0.3.1.4 Improvement Strategies

radix sort

0.3.9 Bucket and Radix | 0.3.10.1 Modified Radix Sort

random probing

recursive decomposition of space

red-black tree

0.2.4 Red-Black Trees | 0.2.8 Skip lists

region quadtrees

rehashing

0.10.1 Run-Length Encoding | 0.10.5 Sliding Window Compression

ripple-shift

0.2.2.1 Analysis | 0.2.3 Binary Search Trees

Rivest

Ron: 0.2.7.5 One-way hashing

RLE

root node

0.2.3 Binary Search Trees | 0.4.5 Spanning Trees

rotate left

rotate operation

rotate right

RSA

0.10.1 Run-Length Encoding | 0.10.5 Sliding Window Compression

run-length encoding

Samuelson-Bauer

0.6.3 Samuelson-Bauer xpression analysis

search

binary: 0.2.1 Linear Search | 0.2.2 Binary Search | 0.2.3 Binary Search Trees
linear: 0.2.1 Linear Search | 0.2.2.1 Analysis

searching

0.2 Data Searching and

selection sort

0.3.7 Selection Sort

sentinel byte

0.10.1 Run-Length Encoding

Shellsort

0.3.5 Insertion Sort | 0.3.6 Shellsort

shortest path

0.4.3 Floyd's Algorithm - | 0.4.4 Dijkstra's Algorithm -

sibling node

signature

digital: 0.2.7.5 One-way hashing

size

hash-table: 0.2.7.3 Choosing a Table

skip list

0.2.8 Skip lists

sliding window compression

sorting

0.5.10 Soundex English word-sounding

comparison based: 0.3 Sorting Algorithms
non-comparison based: 0.3 Sorting Algorithms

sorting algorithms

bubble sort: 0.3.7.1 Analysis | 0.3.8 Bubble Sort
Heapsort: 0.3.3 Heapsort
Insertion sort: 0.3.5 Insertion Sort
Mergesort: 0.3.2 The Mergesort
Quicksort: 0.3.1 The Quicksort
selection sort: 0.3.7 Selection Sort
Shellsort: 0.3.6 Shellsort

Soundex

source message

0.4.1 Graph Representation

spanning tree

0.4.5 Spanning Trees | 0.4.5.1 Prim's Algorithm | 0.4.5.2 Kruskal's Algorithm

sparce graph

stack

0.4.2.1 Depth-first traversal

static

0.2.6 Boyer-Moore String Searching

subsequence

maximum consecutive: 0.5.1 Maximum Consecutive Subsequence

substring search

table

lookup: 0.12.3.1 CRC-CCIT

transitive closure

0.4.6 Transitive Closure

transposition

traversal

0.4.2 Graph Traversal

traversing

tree

0.3.3 Heapsort

B: 0.2.5 B+-Trees
B*: 0.2.5 B+-Trees
B+: 0.2.5 B+-Trees
balanced binary: 0.2.3 Binary Search Trees
binary: 0.2.3 Binary Search Trees | 0.3.3 Heapsort
binary search: 0.2.2 Binary Search | 0.2.2.1 Analysis | 0.2.3 Binary Search Trees
complete: 0.3.3 Heapsort
degenerate binary search: 0.2.3 Binary Search Trees
Huffman: 0.2.9 Tries | 0.10.3 Huffman Compression
node: 0.2.3 Binary Search Trees
root: 0.2.3 Binary Search Trees
spanning: 0.4.5 Spanning Trees | 0.4.5.1 Prim's Algorithm | 0.4.5.2 Kruskal's Algorithm

trie

0.2.9 Tries

uniform hash function

uniquely decodable

unsafe state

value

key: 0.3 Sorting Algorithms
pivot: 0.3.1 The Quicksort

variable string addition

variable-variable