The Self-Taught Computer Scientist

Index
196
base case, 19, 23
best- case complexity, 15, 17
big O notation, 7, 10, 11, 13–14, 15, 17
binary, 63–66
binary heap, 163, 171
binary number, 63
binary search, 27–32, 34
binary search tree data structure, 149, 150, 153, 162
binary tree data structure, 148–149, 153–155, 
160–161, 162
binary_search
 function, 29
BinaryTree
 class, 153
bisect
 module, 31–32
bisect_left
 tool, 31–32
bit, 63
bitwise operators, 66–70, 77
Bloomberg, Michael, 87
boundary condition, 73, 75, 77
bounded queue, 128, 136
bounded stack, 113, 125
branch node, 148, 162
breadth- first search, 155, 162
breadth- first traversal, 155–157, 162
breadth_first_search
 method, 156
brute- force algorithm, 14, 17
bubble sort, 37–42, 54
bubble_sort
 function, 39
buffering, 128–129
C
caesar cipher, 58–61
chain of nodes, 101
character encoding, 33, 35
character set, 32, 34
characters, searching for, 32–34
check_parentheses
 function, 124
child node, 147, 162
cipher, caesar, 58–61
cipher
 function, 60
circular linked list, 103, 112
class
array
, 90–91
BinaryTree
, 153
Graph
, 179
MinStack
, 121–123
Node
, 130
Queue
, 129–133, 134
Stack
, 115
Vertex
, 179
collision, 139, 140, 145, 153
competitive programming, 193
complete graph, 174, 175, 187
computer memory, 84, 86, 89
constant time complexity, 8–9, 17
correctness, 3
cost
 variable, 170
count
 function, 141
cubic time complexity, 13–14, 17
current
 variable, 105–106
current_distance
 variable, 185
current_vertex
 variable, 185
Curry, Steph, 113
cycle, 112, 174, 187
D
data, 25, 27, 37
data set, 25, 34
data structure. 
See also tree data structure
defined, 83, 85
deque, 106
dynamic, 84, 85, 86
first- in, first- out (FIFO), 127, 136
general tree, 147–148
homogeneous, 87, 100
last- in, first- out (LIFO), 113, 125
limited- access, 115, 125
linear, 84, 85, 127, 137
memory for, 84–85
nonlinear, 84, 85
static, 84, 85, 86, 87
traversing, 84
data structure space, 16, 18
data
 variable, 104
decimal system, 64, 65
definiteness, 3
Denhere, Rejoice, 147
depth- first traversal, 157, 162
deque data structure, 106
dequeue
 method, 131, 133, 136
dequeueing, 127, 136
descendants, node, 149–150, 162
dictionary, 143, 185
dijkstra
 function, 184
Dijkstra’s algorithm, 167, 180–186, 187
directed graph, 173–174, 187
divide- and- conquer algorithm, 52, 54
document object model (DOM), 151–152, 162
doubly linked list, 102, 111

---