Algorithms For Dummies

 

   

  

Algorithms For Dummies

random sampling, 343

random surfer, 213

random walks, 343, 350–352

Random-Access Memory (RAM), 37

randomization, 349–350

randomized algorithms, 321–337

random.shuffle

 function, 102

RandomWalkSAT algorithm, 350, 354–355

rank sinks, 219

RankBrain, 222

ranking factors, for search engines, 220–221

real-world problems, modeling, 25–26

reconstruct_path

 function, 381

recursion

about, 103–106

dynamic programming and, 302–305

eliminating tail call recursion, 106–107

reduce

 function, 256–257

redundancy, 174

regular expressions, 400

rehashing, 150

relational equality operator, 82

relational operators, 72

remediation, 118–121

Remember icon, 4

remove()

 function, 87

removing notebooks, 63–64

repetitions, 103

repetitive tasks, performing using 

for

 loop, 83–84

repository, 59

represent_tree

 function, 188–189

requirement arguments, sending, 78–79

reshape

 function, 98–99

resources, 291–294, 402

return

 statement, 79

revenue, optimizing, 365–369

Reverse-delete algorithm, 186

reverse_path

 function, 196

RLE (run-length encoding), 273

robots, heuristics and, 374–377

Romanes, George (author), 30

Roomba, 321

root, 275

root node, 125

rows, in a transition matrix, 216

RSA cryptosystem, 289

RSA’s MD5 algorithm, 151

run-length encoding (RLE), 273

running in polynomial time, 41

Russell, Stuart (author)

Artificial Intelligence: A Modern Approach, 301

S

sampling, 234, 249

satellites, big data and, 230

SayHello()

 function, 80

scalar operations, 92, 93–95

scheduling, algorithms for, 13

SciPy package, 169, 171

scraping, 242

search engines, 208–210

Search for Extraterrestrial Intelligence (SETI), 18, 229

search trees, 142–143

searching, algorithms for, 13, 393

secret data, 394–395

SecretNumber()

 function, 83, 85

Secure Hash Algorithms (SHA), 151

Seki, Takakazu (mathematician), 212

selection sort, 136

self-driving cars, 374

Selfridge-Conway solution, 402

semantic queries, 222

sequences, 86

SETI (Search for Extraterrestrial Intelligence), 18, 229

sets, creating, 85–86

settling time, 25

SHA (Secure Hash Algorithms), 151

Shakey the robot project, 384–385

Shannon, Claude (scientist), 273, 294

shortcut, 195

shortest route, finding the, 192–196

Shuffle_Sort

 function, 263

shuffling combinations, 101–102

Silver, Nate (statistician), 235

simplex algorithm, 357, 361–363

simplifying linear functions, 361

simulated annealing, 343, 346–347

---

Index 

     415

simulation, 36–37, 213

singular matrix, 100

Sizemore, Jim (author)

MATLAB For Dummies, 48

sketching, 234

skunkwords project, 46

Smith, Adam (economist), 28, 286

Social Network Analysis (SNA), 198

sociograms, 198

Solovay, Robert M. (mathematician), 322

Solovay-Strassen algorithm, 323

solutions

brute-force, 29, 30, 34

compared with issues, 19–21

finding, 26–27

reaching good, 32

structuring data to obtain, 21–22

sonar arrays, 374

sorting

algorithms for, 13

data, 134–142, 233, 392

graph elements, 180–182

topological, 182

space complexity, 34

Space/Time Trade-offs in Hash Coding with Allowable 

Errors (Bloom), 239

spanning tree, 183

sparse graph, 182

sparse matrix, 213

sparse representations, 171

spatial issues, 404

special-purpose chips, 17

spider traps, 216, 219

spiders, 209

SQL (Structured Query Language), 48

stacking data in order, 121–125

stacks, 87

str()

 function, 75, 79

Strassen, Volker (mathematician), 322

streaming flows of data, 232–248, 249

strings, creating and using, 74–75

“The String-to-String Correction Problem” (Wagner 

and Fischer), 318

Structured Query Language (SQL), 48

structuring data. See data structuring

subgraphs, 160–161

substitution, 317

summarized data, 233

survivor bias, 26

swarm intelligence, 373

switches, 253

symbolic table, 267

T

Tabu Search, 343, 347–348

tail call recursion, eliminating, 106–107

Technical Stuff icon, 4

teleporting, 219

Teller, Edward (scientist), 328

Tesla P100, 17

testing Kruskal’s algorithm, 189–191

text searches, 400

threads, 252

tile game, 33

time()

 command, 76

time complexity, 34

Tip icon, 3

top-down solutions, 301

topological maps, 374

topological sorting, 182

transforming algorithms for, 13

transition matrix, 216

transpose

 function, 99

transposition, 99

traveling salesman problem (TSP), 312–316, 341, 

372–373

traverse

 function, 128

traversing a graph, 174–180, 203–206

traversing the tree, 127

trees

about, 125–126

building, 126–128

minimum spanning, 183–185

spanning, 183

TSP (traveling salesman problem), 312–316, 341, 

372–373

tuples, 86, 88–89

Turing, Alan (computer scientist), 401

2-SAT, 349–350

---

416