Skip to Main Content
Java 6 Illuminated: An Active Learning Approach, 2nd Edition
book

Java 6 Illuminated: An Active Learning Approach, 2nd Edition

by Julie Anderson, Herve J. Franceschi
February 2008
Intermediate to advanced content levelIntermediate to advanced
1288 pages
39h 39m
English
Jones & Bartlett Learning
Content preview from Java 6 Illuminated: An Active Learning Approach, 2nd Edition
15.2 Running Time Analysis of Algorithms: Counting Statements 1125
choosing n
0
= 2 and c
0
= a
p
(1 + M).
For n >= n
0
, we have
f (n) <= c
0
n
p
and therefore,
f (n) is O(n
p
), i.e., f(n) is Big-Oh of its most dominant term.
15.2 Running Time Analysis of Algorithms:Counting Statements
One simple method to analyze the running time of a code sequence or a
method is simply to count the number of times each statement is executed
and to calculate a total count of statement executions.
Example 15.1 is a method that calculates the total value of all the elements
of an array of size n and returns the sum.
public static int addElements( int [ ] arr )
{
int sum = 0; // ( 1 ) ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

JFC Swing Tutorial, The: A Guide to Constructing GUIs, Second Edition

JFC Swing Tutorial, The: A Guide to Constructing GUIs, Second Edition

Kathy Walrath, Mary Campione, Alison Huml, Sharon Zakhour
Java Illuminated, 4th Edition

Java Illuminated, 4th Edition

Julie Anderson, Hervé J. Franceschi

Publisher Resources

ISBN: 9780763749637