Algorithms in Java, Third Edition, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching

Index

Abstract data type (ADT), 127–195

abstract classes, 163

classes, 129–136

collections of items, 137–139

creating, 157–164

defined, 128

duplicate items, 173–176

equivalence-relations, 159–162

FIFO queues, 165–171

first-class, 177–186

generic operations, 273

index items, 177

insert/remove operations, 138–139

modular programming, 135

polynomial, 188–192

priority queues, 375–376

pushdown stack, 138–156

stubs, 135

symbol table, 497–506

ADT interfaces

array (myArray), 274

complex number (Complex), 181

existence table (ET), 663

full priority queue (PQfull), 397

indirect priority queue (PQi), 403

item (myItem), 273, 498

key (myKey), 498

polynomial (Poly), 189

point (Point), 134

priority queue (PQ), 375

queue of int (intQueue), 166

stack of int ...