Index
A
adjacency 282
adjacency lists 287, 288
adjacency matrix 288, 289, 290
algorithm 35
benefits 36
criteria 36, 37
example 37
performance analysis 37, 38
running time complexity, computing 52, 53, 54
algorithm design techniques 57, 58
divide-and-conquer 60, 61
dynamic programming 68, 69
greedy algorithms 74, 75, 76
recursion 59, 60
algorithms 1
amortized analysis 49
accounting method 50
aggregate analysis 50
potential method 50
Anaconda distribution
download link 5
AND operator 17
arithmetic expression 194
infix notation 194
postfix notation 194, 196
prefix notation 194, 195
arrays 94, 248
used, for implementing stacks 145, 146, 147
asymptotic notation 41
Big O notation 44, 45, 46, 47
for calculating running time complexity 42
omega notation 47, 48, 49
theta notation 42, 43, 44
B
balanced binary tree 184
base address 94
base cases...
