Index

doc , 171

init , 168

name , 106

abstraction, 148
accessor, 68
accumulator, 31
acronym, 61
algorithm
analysis,2, 233
definitionof, 2
designstrategy, 118
divideandconquer, 235
exponentialtime, 245
intractable, 246
lineartime, 234
logtime, 234
quadratic(n-squared)time, 241
algorithms
averagen numbers
countedloop, 123
emptystringsentinel, 128
interactive loop, 126
binarysearch, 233
cannonballsimulation, 162
futurevalue, 23
futurevaluegraph,71, 73
inputvalidation, 135
linearsearch, 232
max-of-three
comparingeachtoall, 115
decisiontree, 116
sequential, 117
median, 189
mergesort, 240
messagedecoding, 48
messageencoding, 47
quadraticequationthree-waydecision, 110
racquetballsimulation
simOneGame, 150
selectionsort, 238
simNGames, 149
temperatureconversion, 14
alias, 69
analysisofalgorithms,2, 233

and, 132

operationaldefinition, 138

AntsGoMarching,The, 100

append, 186

archery, 85, 121

argument, 93

array, 186

associative, 199

arrow (onLines), 82

ASCII, 46

assignmentstatement,10,17–20

sematics, 17

simultaneous, 19

syntax, 17

associative array, 199

attributes, 161

private, 178

averagen numbers

algorithm

emptystringsentinel, 128

problemdescription, 123

program

countedloop, 123

emptystringsentinel, 128

end-of-fileloop, 130

fromfilewithreadlines, 129

interactive loop, 126

negative sentinel, 127

averagetwo numbers, 20

average1.py, 123

average2.py, 126

average3.py, 127

average4.py, 128

average5.py, 129

average6.py, 130

avg2.py, 20

babysitting, 120

batchprocessing, 58

exampleprogram, 58

binary, 4

binarysearch, 232

bit, 33

blackbox, 207

Blackjack, 159

242