Editing 0.0 Contents

?tags: wiki:home

* link:(0.1 Introduction)
  ** link:(0.1.1 What's New)
  link:(0.1.2 What needs work)
  link:(0.1.3 Conventions)
  link:(0.1.4 Example Code)
  * link:(0.2 Data Searching and Storage)
  ** link:(0.2.1 Linear Search)
  link:(0.2.2 Binary Search)
  link:(0.2.3 Binary Search Trees)
  link:(0.2.4 Red-Black Trees)
  link:(0.2.5 B+-Trees)
  link:(0.2.6 Boyer-Moore String Searching)
  link:(0.2.7 Hashing)
  link:(0.2.8 Skip lists)
  link:(0.2.9 Tries)
  link:(0.2.10 Quadtrees and Octrees)
  * link:(0.3 Sorting Algorithms)
  ** link:(0.3.1 The Quicksort)
  link:(0.3.2 The Mergesort)
  link:(0.3.3 Heapsort)
  link:(0.3.4 Benchmarking the Quicksort and the Heapsort)
  link:(0.3.5 Insertion Sort)
  link:(0.3.6 Shellsort)
  link:(0.3.7 Selection Sort)
  link:(0.3.8 Bubble Sort)
  link:(0.3.9 Bucket and Radix Sorting)
  link:(0.3.10 The nth Largest)
  * link:(0.4 Graph Algorithms)
  ** link:(0.4.1 Graph Representation)
  link:(0.4.2 Graph Traversal)
  link:(0.4.3 Floyd's Algorithm - Shortest Paths)
  link:(0.4.4 Dijkstra's Algorithm - Shortest Path)
  link:(0.4.5 Spanning Trees)
  link:(0.4.6 Transitive Closure)
  * link:(0.5 Miscellaneous Algorithms)
  ** link:(0.5.1 Maximum Consecutive Subsequence)
  link:(0.5.2 Permutations)
  link:(0.5.3 Combinations)
  link:(0.5.4 Exponentiation)
  link:(0.5.5 Julian Calendar Algorithms)
  link:(0.5.6 Greatest Common Divisor, Least Common Multiple)
  link:(0.5.7 Addition Chaining)
  link:(0.5.8 Fibonacci Calculation)
  link:(0.5.9 Cartesian and Polar Coordinates)
  link:(0.5.10 Soundex English word-sounding Algorithm)
  link:(0.5.11 Metaphone Algorithm)
  link:(0.5.12 A Pseudo-Random Number Generator)
  link:(0.5.13 Horner's Rule)
  link:(0.5.14 Chinese Remainder Theorem)
  link:(0.5.15 Large Prime Number Generation)
  link:(0.5.16 Fast Fourier Transform)
  * link:(0.6 Formal Language Parsing Algorithms)
  ** link:(0.6.1 Recursive Descent Parsing)
  link:(0.6.2 Cheatham Sattley Method)
  link:(0.6.3 Samuelson-Bauer xpression analysis)
  link:(0.6.4 Shift-reduce bottom-up parsing)
  * link:(0.7 Operating Systems Algorithms)
  ** link:(0.7.1 Dijkstra's Banker's Algorithm for Deadlock Prevention)
  link:(0.7.2 Dekker's Algorithm for Mutual Exclusion)
  link:(0.7.3 Peterson's Algorithm for Mutual Exclusion)
  * link:(0.8 Geometric Algorithms)
  ** link:(0.8.1 Convex Hull Problem)
  link:(0.8.2 Closest Pair Problem)
  link:(0.8.3 Determining Whether a Point is Inside a Polygon)
  link:(0.8.4 Knapsack Problem)
  * link:(0.9 Data Encryption Algorithms)
  * link:(0.10 Data Compression Algorithms)
  ** link:(0.10.1 Run-Length Encoding)
  link:(0.10.2 Integer Coding)
  link:(0.10.3 Huffman Compression)
  link:(0.10.4 Adaptive Huffman Compression)
  link:(0.10.5 Sliding Window Compression)
  link:(0.10.6 Lempel-Ziv-Walsh Compression)
  link:(0.10.7 Arithmetic Compression)
  * link:(0.11 Game-Playing Algorithms)
  ** link:(0.11.1 Minimax Search)
  link:(0.11.2 Alpha-Beta pruning)
  * link:(0.12 Data Integrity)
  ** link:(0.12.1 Checksums)
  link:(0.12.2 Weighted Checksums)
  link:(0.12.3 Cyclic Redundancy Checks)

Help