Essential Algorithms: A Practical Approach to Computer Algorithms

Index

A

abba dabba search, 389–391

adaptive Monte Carlo integration, 54, 496

adaptive quadrature, 44–47, 52

adaptive techniques, 47, 469, 478

AdaptiveGridIntegration program, 47, 48, 496

AdaptiveMidpointIntegration sample program, 44–46

AdaptiveTrapezoidIntegration program, 46

AddEntries method, 109, 506, 508

adding values

AVL trees, 278–281

B-trees, 288–289

2-3 trees, 283–284

addition

sparse matrices, 106–107, 109, 505–508

triangular arrays, 109, 504

addressing, open, 172–174, 182, 183, 480, 514

Adelson-Velskii, G. M., 278. See also AVL t rees

adjacent nodes, 326, 327, 328

Adleman, Leonard, 412

Advanced Encryption Standard (AES), 398, 409–410, 411, 416

after_me, 61–62

age of brother, interview puzzle, 467, 475, 553–554

agreement, consensus problem, 456

AIDS, Folding@home project, 439

airline connectivity matrix, 94–95, 97

algorithmic concepts, summary, 477–486

algorithm basics, 477–478

arrays, 479

balanced trees, 482

complexity theory, 485

cryptographic algorithms, 484–485

decision trees, 482–483

distributed algorithms, 485–486

hash tables, 480

interview puzzles, 486

linked lists, 478

network algorithms, 483–484

numeric algorithms, 478

queues, 479

recursion, 480–481

searching algorithms, 480

sorting algorithms, 479–480

stacks, 479

string algorithms, 484

trees, 481–482

algorithms

approach, 2

basics, 1–23

exercises, 20–23, 487–490

summary of concepts, 477–478

behavior, 2, 477

confusing, 6

correctness, 6, 477

data structures compared to, 3, 22, 477, 489

defined, 1, 3

efficiency, ...