Algorithms For Dummies
distributed computing, 18, 250
Distributed File System (DFS), 253
distributions, 48–51, 325–328
divide-and-conquer approach, 23, 28–30, 107–110
Dorgio, Marco (professor), 373
DoSum()
function, 79
dot
function, 98
dot product, 95
downloading datasets and example code, 58–66
draw()
function, 163
drop_duplicates
function, 119
dynamic programming
about, 299–300
approximating string searches, 317–320
history of, 300–301
knapsack problem, 308–312
memoization, 299–300, 305–307
recursion, 302–305
traveling salesman problem (TSP), 312–316, 341,
372–373
uses of, 301–302
E
edges, counting, 164–166
edit distance, 403
effectiveness, of algorithms, 11
Elastic MapReduce (EMR) (website), 255
elif
clause, 82
else
clause, 82
EMR (Elastic MapReduce) (website), 255
encoding, 266–267
ensemble, 25
Enthogh Canopy Express, 50
equals sign (=), 79
equation, 10–11
escape character, 86
Euclid (mathematician), 12
Euclidean distance, 377
evaluating algorithms, 35–41
example code, downloading, 58–66
exchanges, 135
exponential complexity O(2
n
), 41
exponential time, 289
exporting notebooks, 63
F
factorial complexity O(n!), 41, 105
Fano, Robert M. (professor), 273, 294
Fast Fourier Transform (FFT), 13, 395
Fermi, Enrico (scientist), 328
fetch_20newsgroups
dataset, 65
fetch_olivetti_faces
dataset, 65
FFT (Fast Fourier Transform), 13, 395
fib()
function, 304
Fibonacci heap, 192
Fibonacci sequence, 41, 303
FIFO (first in/first out) sequence, 87, 123
files, distributing, 252–254
fillna
function, 120
finite nature, of algorithms, 11
Finn, J. (author)
Comparison of Probabilistic Test for Primality, 323
first in/first out (FIFO) sequence, 87, 123
Fischer, Michael J. (author)
“The String-to-String Correction Problem,” 318
Flajolet, Philippe (computer scientist), 245
float()
command, 75
floating-point value, 69
Floyd-Warshall algorithm, 193
folding, 150
for loop
, 83–84
format()
function, 86
formula, 11
FORmula TRANslation (FORTRAN), 45
Fourier Transform, 395
fractional knapsack problem, 309
fraud detection, 221
friendship graphs, 198
Fruchterman-Reingold force-directed algorithm,
200–201
function arguments, giving a default value, 80
functional programming languages, 255
functionality, measuring for graphs, 164–169
functions. See also specific functions
calling, 78–81
creating and using, 77–81
objective, 343, 344, 360
one-way, 401
working with, 38–41
Do'stlaringiz bilan baham: |