Algorithms For Dummies

Index 

     405

A

A* algorithm, 35, 384–387

abscissa, 39

abstract machines, simulating using, 36–37

a-cyclic graph, 181

Adamszek, Anna and Michal (authors)

“Combinatorics of the Change-Making Problem,” 32

advanced matrix operations, 98–100

ALGOrithmic Language (ALGOL), 45

algorithms. See also specific algorithms; specific topics

about, 9–11

evaluating, 35–41

finding, 14–15

uses of, 11–14

world-changing, 391–397

allclose

 function, 100

allowable errors, 239

Amazon Web Services (AWS), 18

Anaconda, 44

analysis of algorithms, 36

“The Anatomy of a LargeScale Hypertextual Web 

Search Engine” (Brin and Page), 210

Anderson, Chris (editor-in-chief), 231

annotation, 307

append()

 function, 87

approximating string search, 317–320

arcs, 157

arguments, 78–81

Aristotle (philosopher), 28

arithmetic operators, 70–71

ARMAC, 192

array

 function, 95

Artificial Intelligence: A Modern Approach (Russell and 

Norvig), 301

artificial neurons, 17

The Art of Computer Programming (Knuth), 13, 36, 43

asarray

 function, 97

ASCII system, 267

asmatrix

 function, 97

assignment operators, 69–70, 82

astronomy, big data and, 229

asynchronous outputs, parallelism and, 252

Atlantic City algorithms, 323

authorities, 211

automatic responses, 397

automation, 397

available data, leveraging, 18–19

AWS (Amazon Web Services), 18

B

Babbage, Charles (mathematician), 36

balanced trees, 128

Bayes’ Theorem, 20–21

Bélády, László (computer scientist), 290–291

Bellman, Richard Ernest (mathematician), 299, 300

Bellman-Ford algorithm, 193

best-first search (BFS), 380

Bezzel, Max (chess expert), 345

BFS (best-first search), 380

BFS (breadth-first search), 34, 176–177, 343

bidirectional search, 34

big data

about, 225–226

characteristics of, 231

streaming flows of, 232–248

transforming power into, 226–232

Big O notation, 39–41, 111

binary heaps, 142–143, 146–147

binary max heap, 144

binary min heap, 144

binary search tree (BST), 143

binary search trees, building, 145–146

binary trees, creating, 146

binaryTree

 class, 127

bintrees

, 145–146

bit streams, 268

bit vector, 240