Next: About this document ...
Up: Algorithm Archive (Work in
Previous: 0.12.3.4 References
- adaptive
- 0.10 Data Compression Algorithms
- addition chaining
- 0.5.7 Addition Chaining
- adjacency list
- 0.4.1 Graph Representation
- adjacency matrix
- 0.4.1 Graph Representation
- adjacent nodes
- 0.4 Graph Algorithms
- 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
- 0.10 Data Compression Algorithms
| 0.10.1 Run-Length Encoding
- b+-tree
- 0.2.8 B+-Trees
- balanced binary tree
- 0.2.6 Binary Search Trees
- balanced tree
- 0.2.7 Red-Black Trees
- banker's algorithm
- 0.7.1 Dijkstra's Banker's Algorithm
- benchmarking
- 0.3.4 Benchmarking the Quicksort
- bernoulli model
- 0.10.2 Integer Coding
- binary search
- 0.2.1 Linear Search
| 0.2.2 Binary Search
| 0.2.3 Binary Search Trees
| 0.2.4 Linear Search
| 0.2.5 Binary Search
| 0.2.6 Binary Search Trees
- binary search tree
- 0.2.2 Binary Search
| 0.2.2.1 Analysis
| 0.2.3 Binary Search Trees
| 0.2.5 Binary Search
| 0.2.5.1 Analysis
| 0.2.6 Binary Search Trees
| 0.2.7 Red-Black Trees
| 0.2.11 Skip lists
| 0.2.12 Tries
- binary squares and multiply
- 0.5.7.1 Source Code
- binary tree
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
- black depth
- 0.2.7 Red-Black Trees
- block-block
- 0.10 Data Compression Algorithms
- boyer-moore
- 0.2.9 Boyer-Moore String Searching
- breadth-first traversal
- 0.4.2.2 Breadth-first traversal
- brute force
- 0.2.1 Linear Search
| 0.2.4 Linear Search
- BST
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
- 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
- 0.5.9 Cartesian and Polar
- CCIT
- 0.12.3.1 CRC-CCIT
- chaining
- addition
- 0.5.7 Addition Chaining
- chaining variables
- 0.2.10.5 One-way hashing
- checksum
- 0.12.1 Checksums
| 0.12.3 Cyclic Redundancy Checks
- weighted
- 0.12.1 Checksums
| 0.12.3 Cyclic Redundancy Checks
- child node
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
| 0.3.3 Heapsort
- circuit
- 0.4.5 Spanning Trees
- Hamilton
- 0.4.2.4 Hamilton Circuits
- circular wait
- 0.7.1 Dijkstra's Banker's Algorithm
- claim
- 0.7.1 Dijkstra's Banker's Algorithm
- class
- equivalence
- 0.4.5.2 Kruskal's Algorithm
- closed hashing
- 0.2.10.2 Dealing with Collisions
- clusters
- 0.2.10.2 Dealing with Collisions
- 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
- 0.2.10 Hashing
- color-flip
- 0.2.7.1 Insertion Operation
- comparison based sorting
- 0.3 Sorting Algorithms
- 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
- 0.2.10.1 Selecting a Hash
| 0.2.10.5 One-way hashing
- convex hull
- 0.8.1 Convex Hull Problem
- coordinates
- Cartesian
- 0.5.9 Cartesian and Polar
- polar
- 0.5.9 Cartesian and Polar
- CRC
- 0.12.3 Cyclic Redundancy Checks
- CCIT
- 0.12.3.1 CRC-CCIT
- cycle
- Euler
- 0.4.2.3 Euler Cycles
- cyclic redundancy check
- 0.12.3 Cyclic Redundancy Checks
- data clumping
- 0.2.10.1 Selecting a Hash
- data clusters
- 0.2.10.2 Dealing with Collisions
- data compression
- 0.10 Data Compression Algorithms
- DCT
- 0.10.1 Run-Length Encoding
- deadlock
- avoidance
- 0.7.1 Dijkstra's Banker's Algorithm
- deadly embrace
- 0.7.1 Dijkstra's Banker's Algorithm
- decoding
- 0.10 Data Compression Algorithms
- degenerate binary search tree
- 0.2.6 Binary Search Trees
| 0.2.7 Red-Black Trees
- delta codes
- 0.10.2 Integer Coding
- dense graph
- 0.4.3 Floyd's Algorithm -
- depth-first traversal
- 0.4.2.1 Depth-first traversal
- di-graph
- 0.4 Graph Algorithms
- dictionary codes
- 0.10.5 Sliding Window Compression
- dictionary-based
- 0.10.5 Sliding Window Compression
- Dijkstra
- 0.7.1 Dijkstra's Banker's Algorithm
- Dijkstra's algorithm
- 0.4.3 Floyd's Algorithm -
| 0.4.4 Dijkstra's Algorithm -
- diminishing increment sort
- 0.3.6 Shellsort
- directed graph
- 0.4 Graph Algorithms
- distinct
- 0.10 Data Compression Algorithms
- division method
- 0.2.10.1 Selecting a Hash
- dualhashing
- 0.2.10.2 Dealing with Collisions
- dynamic
- 0.10 Data Compression Algorithms
- dynamic programming
- 0.8.4 Knapsack Problem
- edge
- 0.4 Graph Algorithms
- Elias codes
- 0.10.2 Integer Coding
- encoding
- 0.10 Data Compression Algorithms
- run-length
- 0.10.1 Run-Length Encoding
| 0.10.5 Sliding Window Compression
- ensemble
- 0.10 Data Compression Algorithms
- equivalence class
- 0.4.5.2 Kruskal's Algorithm
- Euclid's algorithm
- 0.5.6.1 Source Code
- Euler
- 0.3.1.3 Analysis
- Euler cycle
- 0.4.2.3 Euler Cycles
- Euler's constant
- 0.3.1.3 Analysis
- 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.10.5 One-way hashing
- flag byte
- 0.10.5 Sliding Window Compression
- Floyd's algorithm
- 0.4.3 Floyd's Algorithm -
| 0.4.4 Dijkstra's Algorithm -
- force
- brute
- 0.2.1 Linear Search
| 0.2.4 Linear Search
- function
- compression
- 0.2.10.1 Selecting a Hash
| 0.2.10.5 One-way hashing
- fuzzy search
- 0.5.10 Soundex English word-sounding
- Gamma codes
- 0.10.2 Integer Coding
- GCD
- 0.5.6 Greatest Common Divisor,
- generator
- pseudo-random number
- 0.5.12 A Pseudo-Random Number
- Golomb codes
- 0.10.2 Integer Coding
- graph
- 0.4 Graph Algorithms
- 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.5.6 Greatest Common Divisor,
- greedy algorithm
- 0.4.4 Dijkstra's 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
- 0.2.10 Hashing
- closed hashing
- 0.2.10.2 Dealing with Collisions
- dualhashing
- 0.2.10.2 Dealing with Collisions
- linear probing
- 0.2.10.2 Dealing with Collisions
- one-way
- 0.2.10.5 One-way hashing
- open hashing
- 0.2.10.2 Dealing with Collisions
- quadratic probing
- 0.2.10.2 Dealing with Collisions
- random probing
- 0.2.10.2 Dealing with Collisions
- rehashing
- 0.2.10.2 Dealing with Collisions
- table-size
- 0.2.10.3 Choosing a Table
- uniform hash function
- 0.2.10.1 Selecting a Hash
- hash function
- 0.2.10 Hashing
- hash table
- 0.2.10 Hashing
| 0.2.12 Tries
- hash value
- 0.2.10 Hashing
- hash-table size
- 0.2.10.3 Choosing a Table
- hashing
- closed
- 0.2.10.2 Dealing with Collisions
- open
- 0.2.10.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
- 0.7.1 Dijkstra's Banker's Algorithm
- homogeneous sets
- 0.3 Sorting Algorithms
- Huffman coding
- 0.2.12 Tries
- Huffman compression
- 0.2.12 Tries
| 0.10.3 Huffman Compression
- Huffman tree
- 0.2.12 Tries
| 0.10.3 Huffman Compression
- hull
- convex
- 0.8.1 Convex Hull Problem
- i-node
- 0.2.8 B+-Trees
- improvement
- Quicksort
- 0.3.1.4 Improvement Strategies
- improvements
- mergesort
- 0.3.2.2 Improvements
- index node
- 0.2.8 B+-Trees
- insertion sort
- 0.3.5 Insertion Sort
- integer coding
- 0.10.2 Integer Coding
- internal node
- 0.3.3.1 Building a Max-Heap
- internal nodes
- 0.2.7 Red-Black Trees
- JPEG
- 0.10.1 Run-Length Encoding
- 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.3 Sorting Algorithms
- knapsack problem
- 0.8.4 Knapsack Problem
- Kruskal's algorithm
- 0.4.5.2 Kruskal's Algorithm
- LCM
- 0.5.6 Greatest Common Divisor,
- leaf nodes
- 0.2.7 Red-Black Trees
- least common multiple
- 0.5.6 Greatest Common Divisor,
- Lempel
- Abraham
- 0.10.5 Sliding Window Compression
- linear probing
- 0.2.10.2 Dealing with Collisions
- linear search
- 0.2.1 Linear Search
| 0.2.2.1 Analysis
| 0.2.4 Linear Search
| 0.2.5.1 Analysis
- linked list
- 0.2.2.1 Analysis
| 0.2.5.1 Analysis
| 0.4.1 Graph Representation
- linked-list
- 0.2.6 Binary Search Trees
| 0.2.10.2 Dealing with Collisions
| 0.3.2.1 Analysis
- list
- adjacency
- 0.4.1 Graph Representation
- linked
- 0.2.2.1 Analysis
| 0.2.5.1 Analysis
- lossless
- 0.10 Data Compression Algorithms
- lossy
- 0.10 Data Compression Algorithms
- 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
- 0.5.1 Maximum Consecutive Subsequence
- MD5
- 0.2.10.5 One-way hashing
- median
- 0.2.2 Binary Search
| 0.2.5 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
- 0.5.11 Metaphone Algorithm
- method
- division
- 0.2.10.1 Selecting a Hash
- multiplication
- 0.2.10.1 Selecting a Hash
- min-heap
- 0.3.3 Heapsort
| 0.4.5.2 Kruskal's Algorithm
- multipilcation method
- 0.2.10.1 Selecting a Hash
- node
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
| 0.4 Graph Algorithms
- child
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
- index
- 0.2.8 B+-Trees
- parent
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
- root
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
| 0.4.5 Spanning Trees
- sibling
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
- nodes
- adjacent
- 0.4 Graph Algorithms
- non-comparison based sorting
- 0.3 Sorting Algorithms
- non-leaf node
- 0.3.3.1 Building a Max-Heap
- non-preemptive allocation
- 0.7.1 Dijkstra's Banker's Algorithm
- non-sharable
- 0.7.1 Dijkstra's Banker's Algorithm
- nth largest
- 0.3.10 The nth Largest
- numbers
- pseudo-random
- 0.5.12 A Pseudo-Random Number
- octree
- 0.2.13 Quadtrees and Octrees
- open hashing
- 0.2.10.2 Dealing with Collisions
- parent node
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
| 0.3.3 Heapsort
- partition
- 0.3.1 The Quicksort
| 0.3.1.2 Partitioning
- phonetic search
- 0.5.10 Soundex English word-sounding
| 0.5.11 Metaphone Algorithm
- 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
- 0.12.3 Cyclic Redundancy Checks
- divisor
- 0.12.3 Cyclic Redundancy Checks
- Pope
- Gregory XIII
- 0.5.5.1 A Brief History
- pre-image
- 0.2.10 Hashing
- pre-text
- 0.2.10.5 One-way hashing
- prefix code
- 0.10 Data Compression Algorithms
- Prim's algorithm
- 0.4.5.1 Prim's Algorithm
- programming
- dynamic
- 0.8.4 Knapsack Problem
- pseudo-random numbers
- 0.5.12 A Pseudo-Random Number
- push-down
- 0.3.3.4 Analysis
- quadratic probing
- 0.2.10.2 Dealing with Collisions
- quadtree
- 0.2.13 Quadtrees and Octrees
- queue
- 0.4.2.2 Breadth-first traversal
- 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
- 0.2.10.2 Dealing with Collisions
- recursive decomposition of space
- 0.2.13 Quadtrees and Octrees
- red-black tree
- 0.2.7 Red-Black Trees
| 0.2.11 Skip lists
- region quadtrees
- 0.2.13 Quadtrees and Octrees
- rehashing
- 0.2.10.2 Dealing with Collisions
- ripple-shift
- 0.2.2.1 Analysis
| 0.2.3 Binary Search Trees
| 0.2.5.1 Analysis
| 0.2.6 Binary Search Trees
- Rivest
- Ron
- 0.2.10.5 One-way hashing
- RLE
- 0.10.1 Run-Length Encoding
| 0.10.5 Sliding Window Compression
- root node
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
| 0.4.5 Spanning Trees
- rotate left
- 0.2.7.1 Insertion Operation
- rotate operation
- 0.2.7.1 Insertion Operation
- rotate right
- 0.2.7.1 Insertion Operation
- RSA
- 0.2.10.5 One-way hashing
- run-length encoding
- 0.10.1 Run-Length Encoding
| 0.10.5 Sliding Window Compression
- 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
| 0.2.4 Linear Search
| 0.2.5 Binary Search
| 0.2.6 Binary Search Trees
- linear
- 0.2.1 Linear Search
| 0.2.2.1 Analysis
| 0.2.4 Linear Search
| 0.2.5.1 Analysis
- searching
- 0.2 Data Searching and
| 0.2.3 Binary Search Trees
- 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
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
- signature
- digital
- 0.2.10.5 One-way hashing
- size
- hash-table
- 0.2.10.3 Choosing a Table
- skip list
- 0.2.11 Skip lists
- sliding window compression
- 0.10.5 Sliding Window Compression
- sorting
- 0.3 Sorting Algorithms
- 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
- 0.5.10 Soundex English word-sounding
- source message
- 0.10 Data Compression Algorithms
- spanning tree
- 0.4.5 Spanning Trees
| 0.4.5.1 Prim's Algorithm
| 0.4.5.2 Kruskal's Algorithm
- sparce graph
- 0.4.1 Graph Representation
- stack
- 0.4.2.1 Depth-first traversal
- static
- 0.10 Data Compression Algorithms
- subsequence
- maximum consecutive
- 0.5.1 Maximum Consecutive Subsequence
- substring search
- 0.2.9 Boyer-Moore String Searching
- table
- lookup
- 0.12.3.1 CRC-CCIT
- transitive closure
- 0.4.6 Transitive Closure
- transposition
- 0.12.3 Cyclic Redundancy Checks
- traversal
- 0.4.2 Graph Traversal
- traversing
- 0.4 Graph Algorithms
- tree
- 0.3.3 Heapsort
- B
- 0.2.8 B+-Trees
- B*
- 0.2.8 B+-Trees
- B+
- 0.2.8 B+-Trees
- balanced binary
- 0.2.6 Binary Search Trees
- binary
- 0.2.3 Binary Search Trees
| 0.2.6 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
| 0.2.5 Binary Search
| 0.2.5.1 Analysis
| 0.2.6 Binary Search Trees
- complete
- 0.3.3 Heapsort
- degenerate binary search
- 0.2.6 Binary Search Trees
- Huffman
- 0.2.12 Tries
| 0.10.3 Huffman Compression
- node
- 0.2.3 Binary Search Trees
| 0.2.6 Binary Search Trees
- root
- 0.2.3 Binary Search Trees
| 0.2.6 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.12 Tries
- uniform hash function
- 0.2.10.1 Selecting a Hash
- uniquely decodable
- 0.10 Data Compression Algorithms
- unsafe state
- 0.7.1 Dijkstra's Banker's Algorithm
- value
- key
- 0.3 Sorting Algorithms
- pivot
- 0.3.1 The Quicksort
- variable string addition
- 0.2.10.1 Selecting a Hash
- variable-variable
- 0.10 Data Compression Algorithms
- variables
- chaining
- 0.2.10.5 One-way hashing
- vertex
- 0.4 Graph Algorithms
| 0.4.3 Floyd's Algorithm -
- weighted checksum
- 0.12.1 Checksums
- weighted graph
- 0.4 Graph Algorithms
| 0.4.5 Spanning Trees
- Xmodem CRC
- 0.12.3.1 CRC-CCIT
- Ziv
- Jacob
- 0.10.5 Sliding Window Compression
Scott Gasch
1999-05-28