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
8.6 Searching and Sorting Arrays 527
return i;
}
return -1; // end of array reached without finding key
// or an element larger than the key was found
}
In fact, if the array is sorted, it can be searched even more efficiently using
an algorithm called Binary Search, which we explain in the next section.
8.6.6 Binary Search of a Sorted Array
If youve played the Guess a Numbergame, you probably have used the
concept of a Binary Search. In this game, someone asks you to guess a
secret number between 1 and 100. For each number you guess, they tell
you whether the secret number is larger or smaller than your guess. A
good strategy is to guess the number ...
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