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
1138 CHAPTER 15 Running Time Analysis
15.5 Running Time Analysis of Searching and Sorting Algorithms
In studying the running time of various searching and sorting algorithms,
we will look at the following scenarios:
best case
worst case
average case
Some methods have a very efficient running time. We mentioned earlier
that the running time of Binary Search was log n. Thus, searching a sorted
array of 1 billion items using Binary Search will only take 30 statement exe-
cutions since log (1 billion) is approximately 30.
Example 15.7 shows the code of the recursive binary search method intro-
duced in Chapter 13.
public static int recursiveBinarySearch
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