Balanced binary search tree,
546
Base address
for two-dimensional arrays,
83
and RevPrint function,
415
and ValueInList function,
411
Behavior responsibilities,
172
and comparison of rates of growth,
161
in comparison of Unsorted and Sorted List
ADT algorithms,
164-167
and depth of recursion,
429
and implicit representation,
578
Insertion Sort in terms of,
600
Queue ADT implementations comparisons and,
304-306
radix sorts analyzed in terms of,
642
selection sort algorithm analyzed in terms
of,
592
ShortBubble algorithm analyzed in terms
of,
597
and sorted list implementations
comparisons,
324-326
sorts compared in terms of,
643
Stack ADT implementations comparisons and,
295,
296
unsorted list operations comparison and,
316-317
linear search compared with,
155, 166
rate of growth with linear search and,
622
Big-O comparison between linear lists and,
505-506
and implementing priority queues,
532
linear lists compared with,
504-506
location of maximum value in,
482
priority queue implemented with,
546
storage of in array with dummy values,
509
tree parameter as pointer within,
474
with array representation,
507
nonlinked representation of,
506-509
visualizing traversals,
492
Bit vector representation,
574
Black-box testing,
36,
145
for ADT Unsorted List implementation,
144
and LargeInt operation,
391
Boolean operators
and explicit representation,
574
in index building case study,
510
in real estate listings case study,
173-174
in simulation case study,
249
BreadthFirstSearch function
Buckets
collisions handled by hashing with,
632
Built-in composite data types