Abstraction................................................16
Accessing
array......................................................44
double-linked list...............................................................89
linked list......................................................................78
space-efficient..........................................................284
Adaptability.............................................41, 130
Algorithm analysis....................8
efficiency
space9
time9
time, running time9
evaluation............9
lower bounds9
optimality9
performance10
growth orders......................9, 10
average-case10
best-case10
worst-case10
Algorithms...........................................2, 6
programming vs. problems ........................................................ ...