.5
xii
5.1
A quick overview
of
methods 134
Methods
as
complexity I
35,
Methods
as
for
than
users
1
35,
Method calls
as
as
messages 1 37
5.2
Writing your
own
methods 138
format
of
a 139,
return
statement
139,
structures
141, Methods that
return
nonnumeric methods 144
5.3
Mechanics of the method-calling process 147
Parameter 1 methods
from
within other
methods
5.4 Decomposition 158
Stepwise 1 Specifying parameters 161,
Designing
the
top down 163, Looking for common
features
164, Completing decomposition 165
5.5 Algorithmic methods 166
The
"brute force" 1 algorithm 168,
Defending
the
of algorithm 168, Comparing
the
efficiency
of
the
two algorithms 170
Summary 170
Review
questions
171
Programming exercises 172
~"b.!J
0:
- n
Ulidl~e(ij'~
{nlii[i]
6.1
Using
the
RandomGenerator
class 178
Pseudorandom numbers 179,
RandomGenerator
class 180,
The
role
of
random 183
6.2
The
java doc documentation
system
185
6.3
Defining
your
own
classes 188
The
structure
of
a
closs
1
entries
189, Encapsulation 189
6.4
Representing student information 190
Declaring instance variables 190,
definition 191, Writing
javadoc
comments
constructor
194,
Getters and
setters
1
method
196, Defining named constants
in
a
the
Student
closs
198
6.5
Rational
numbers 199
6.6
Extending
existing classes 204
Creating a
closs
to
represent filled rectangles
inherited constructors 208,
Rules
for
inherited
Summary
211
Review
questions 213
Progromming exercises 214
visibility
of
评论1