Grokking Algorithms, Second Edition

index

A

algorithms

running times of, growth rates of 11–13

run-time analysis, worst-case run time 15

approximate solution 205

approximation algorithms 197

arrays

linked lists and 24–25

terminology 27

ASCII (American Standard Code for Information Interchange) 134

asymmetric key encryption 259

average case 70

quicksort, vs. worst case 75

AVL trees 151

B

balanced trees 141, 150, 164

AVL trees 151

B-trees 162–164

improving insertion speed with 143

rotation 151

splay trees 159

balance factor 154

base case, in recursion 44–45

Bellman-Ford algorithm 180

BFS (breadth-first search) 101, 120

graphs, overview of 102–104

implementing BFS algorithm 113–117

implementing graph 111–112

overview of 106, 109

shortest path problem, using breadth-first search