Large integers
representing with linked lists,
380
Larger integer ADT implementation case
study,
379-392
linked implementation and Big-O measure
for,
316,
317
Life-cycle verification activities,
59
Linear doubly linked list,
345
Linear lists
binary search trees compared with,
504-506
chaining schemes compared with,
633
collisions handled with,
626
Linear relationships,
124
in linked list data structures,
334
binary search compared with,
155, 166
rate of growth with binary search and,
622
advantages/disadvantages with,
621
Linked implementation
Big-O comparison of queue operations for,
306
Big-O comparison of sorted list operations
for,
326
Big-O comparison of unsorted list
operations for,
317
Linked-list representation,
133
design notation, dynamic pointers,
array-of-records "pointers" and,
367
large integers represented with,
380
in static and dynamic storage,
360
Linked queue representation,
297
Linked sorted lists
and implementing priority queues,
532
with headers and trailers,
334
inserting items into,
139
and linked structure,
365
location
for array-based implementation,
133
and InsertItem operation,
147
for one-dimensional arrays,
77-79
for sorting algorithms,
588
for two-dimensional arrays,
82-83
for user-defined string I/O class,
100