# Index
### <a>E</a>
*e*, [524](LiB0097.html#1314)
Edge (arc), [97](LiB0026.html#266)
Elementary event, [531](LiB0100.html#1328)
Elements, of sets, [527](LiB0098.html#1321)
Empty set, [528](LiB0098.html#1322)
Encryption, [477](LiB0087.html#1202)
Enqueue, [235](LiB0047.html#569)
EPL (external path length), [303](LiB0064.html#721)
Equivalence class modulo *n* containing *m*, [438](LiB0083.html#1065)
ERCW (exclusive-read, concurrent-write), [495](LiB0091.html#1253)
EREW (exclusive-read, exclusive-write), [495](LiB0091.html#1253)
Essentially complete binary tree, [285](LiB0056.html#669)
**Euclid's Algorithm,** [428-430](LiB0082.html#1031)
extension to, [432-434](LiB0082.html#1042)
worst-case time complexity, [430-431](LiB0082.html#1038)
**Euclid's Algorithm [2](LiB0008.html#18),** [432-434](LiB0082.html#1042)
Euler's totient function, [441-442](LiB0083.html#1077)
Event, [531](LiB0100.html#1328)
Every-case time complexity analysis, [19](LiB0010.html#60), [25](LiB0010.html#75)
**Floyd's algorithm for shortest paths,** [103](LiB0026.html#278)
**Minimum Multiplications,** [113-114](LiB0028.html#300)
**Optimal Binary Search Tree,** [123](LiB0029.html#323)
**Partition,** [63](LiB0018.html#184)
**Prim's Algorithm,** [148-150](LiB0033.html#379)
**Strassen,** [70-71](LiB0019.html#202)
**Exchange Sort,** [277](LiB0054.html#650), [380](LiB0075.html#889)
algorithm, [7-8](LiB0008.html#30)
analysis summary, [273](LiB0053.html#641)
decision tree, [298-300](LiB0062.html#704)
every-case time complexity, [19-20](LiB0010.html#60)
as in-place sort, [273](LiB0053.html#641)
input size, [17](LiB0009.html#56)
as selection sort, [275](LiB0053.html#646)
in threshold determination, [79-80](LiB0021.html#224)
time complexity, [33](LiB0011.html#102)
Exclusive-read
concurrent-write (ERCW), [495](LiB0091.html#1253)
exclusive-write (EREW), [495](LiB0091.html#1253)
Expected value, [367](LiB0072.html#863), [541](LiB0100.html#1351)
External path length (EPL), [303](LiB0064.html#721)
External search, [338](LiB0070.html#803)
Extra space usage
**Mergesort [4](LiB0008.html#25),** [283](LiB0055.html#663)
**Quicksort,** [284-285](LiB0056.html#666)
- Table of Contents
- BackCover
- Foundations of Algorithms Using C++ Pseudocode, Third Edition
- Preface
- Chapter Contents
- Pedagogy
- Course Outlines
- Acknowledgments
- Errors
- Chapter 1: Algorithms - Efficiency, Analysis, and Order
- 1.2 The Importance of Developing Efficient Algorithms
- 1.3 Analysis of Algorithms
- 1.4 Order
- 1.5 Outline of This Book
- Exercises
- Chapter 2: Divide-and-Conquer
- 2.1 Binary Search
- 2.2 Mergesort
- 2.3 The Divide-and-Conquer Approach
- 2.4 Quicksort (Partition Exchange Sort)
- 2.5 Strassen's Matrix Multiplication Algorithm
- 2.6 Arithmetic with Large Integers
- 2.7 Determining Thresholds
- 2.8 When Not to Use Divide-and-Conquer
- Exercises
- Chapter 3: Dynamic Programming
- 3.1 The Binomial Coefficient
- 3.2 Floyd's Algorithm for Shortest Paths
- 3.3 Dynamic Programming and Optimization Problems
- 3.4 Chained Matrix Multiplication
- 3.5 Optimal Binary Search Trees
- 3.6 The Traveling Salesperson Problem
- Exercises
- Chapter 4: The Greedy Approach
- 4.1 Minimum Spanning Trees
- 4.2 Dijkstra's Algorithm for Single-Source Shortest Paths
- 4.3 Scheduling
- 4.4 Huffman Code
- 4.5 The Greedy Approach versus Dynamic Programming: The Knapsack Problem
- Exercises
- Chapter 5: Backtracking
- 5.2 The n-Queens Problem
- 5.3 Using a Monte Carlo Algorithm to Estimate the Efficiency of a Backtracking Algorithm
- 5.4 The Sum-of-Subsets Problem
- 5.5 Graph Coloring
- 5.6 The Hamiltonian Circuits Problem
- 5.7 The 0-1 Knapsack Problem
- Exercises
- Chapter 6: Branch-and-Bound
- 6.1 Illustrating Branch-and-Bound with the 0 - 1 Knapsack problem
- 6.2 The Traveling Salesperson Problem
- 6.3 Abductive Inference (Diagnosis)
- Exercises
- Chapter 7: Introduction to Computational Complexity - The Sorting Problem
- 7.2 Insertion Sort and Selection Sort
- 7.3 Lower Bounds for Algorithms that Remove at Most One Inversion per Comparison
- 7.4 Mergesort Revisited
- 7.5 Quicksort Revisited
- 7.6 Heapsort
- 7.6.1 Heaps and Basic Heap Routines
- 7.6.2 An Implementation of Heapsort
- 7.7 Comparison of Mergesort, Quicksort, and Heapsort
- 7.8 Lower Bounds for Sorting Only by Comparison of Keys
- 7.8.1 Decision Trees for Sorting Algorithms
- 7.8.2 Lower Bounds for Worst-Case Behavior
- 7.8.3 Lower Bounds for Average-Case Behavior
- 7.9 Sorting by Distribution (Radix Sort)
- Exercises
- Chapter 8: More Computational Complexity - The Searching Problem
- 8.1 Lower Bounds for Searching Only by Comparisons of Keys
- 8.2 Interpolation Search
- 8.3 Searching in Trees
- 8.4 Hashing
- 8.5 The Selection Problem: Introduction to Adversary Arguments
- Exercises
- Chapter 9: Computational Complexity and Interactability - An Introduction to the Theory of NP
- 9.2 Input Size Revisited
- 9.3 The Three General Problem Categories
- 9.4 The Theory of NP
- 9.5 Handling NP-Hard Problems
- Exercises
- Chapter 10: Number-Theoretic Algorithms
- 10.1 Number Theory Review
- 10.2 Computing the Greatest Common Divisor
- 10.3 Modular Arithmetic Review
- 10.4 Solving Modular Linear Equations
- 10.5 Computing Modular Powers
- 10.6 Finding Large Prime Numbers
- 10.7 The RSA Public-Key Cryptosystem
- Exercises
- Chapter 11: Introduction to Parallel Algorithms
- 11.1 Parallel Architectures
- 11.2 The PRAM Model
- Exercises
- Appendix A: Review of Necessary Mathematics
- A.2 Functions
- A.3 Mathematical Induction
- A.4 Theorems and Lemmas
- A.5 Logarithms
- A.6 Sets
- A.7 Permutations and Combinations
- A.8 Probability
- Exercises
- Appendix B: Solving Recurrence Equations - With Applications to Analysis of Recursive Algorithms
- B.2 Solving Recurrences Using the Characteristic Equation
- B.3 Solving Recurrences by Substitution
- B.4 Extending Results for n, a Power of a Positive Constant b, to n in General
- B.5 Proofs of Theorems
- Exercises
- Appendix C: Data Structures for Disjoint Sets
- References
- Index
- Index_B
- Index_C
- Index_D
- Index_E
- Index_F
- Index_G
- Index_H
- Index_I
- Index_J
- Index_K
- Index_L
- Index_M
- Index_N
- Index_O
- Index_P
- Index_Q
- Index_R
- Index_S
- Index_T
- Index_U
- Index_V
- Index_W-X
- Index_Y
- Index_Z
- List of Figures
- List of Tables
- List of Algorithms, Examples, and Theorems
- List of Sidebars