Binary search algorithm:

The binary search algorithm is used to find an item in an array and the search array should be in the sorted order.

The searching is started in the middle of the array.

In the searching process, the algorithm finds an item or eliminates half of the array in each comparison.

If the search item is less than the middle item, then it eliminates the second half of the array, and it continues to search in the first half of the array.

If the search item is greater than the middle item, then it eliminates the first half of the array, and it continues to search in the second half of the array.

Once again, it examines the middle and repeats the above steps to find an item.

If the middle item is equal to search item, then the searching is stopped...

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 17, Problem 2SA

Chapter 17, Problem 4SA

Students have asked these similar questions

Sorting is a basic issue with arrays in which the goal is to find the target element in the array. Choose from the following options: False

In a partially populated array, how do you maintain track of elements with data?

If a sequential search method is searching for a value that is stored in the last element of a 10,000-element array, how many elements will the search code have to read to locate the value?

Chapter 17 Solutions

EBK STARTING OUT WITH JAVA

Ch. 17.1 - Prob. 17.1CP Ch. 17.1 - Prob. 17.2CP Ch. 17.1 - Prob. 17.3CP Ch. 17.1 - Prob. 17.4CP Ch. 17.2 - Prob. 17.5CP Ch. 17.2 - Prob. 17.6CP Ch. 17.2 - Prob. 17.7CP Ch. 17.2 - If a sequential search is performed on an array,...Ch. 17.3 - Prob. 17.9CP Ch. 17.3 - Prob. 17.10CP

Ch. 17.3 - Prob. 17.11CP Ch. 17.3 - Prob. 17.12CP Ch. 17.3 - Prob. 17.13CP Ch. 17.3 - Prob. 17.14CP Ch. 17.3 - Let a[ ] and b[ ] be two integer arrays of size n....Ch. 17.3 - Prob. 17.16CP Ch. 17.3 - Prob. 17.17CP Ch. 17.3 - Prob. 17.18CP Ch. 17 - Prob. 1MC Ch. 17 - Prob. 2MC Ch. 17 - Prob. 3MC Ch. 17 - Prob. 4MC Ch. 17 - Prob. 5MC Ch. 17 - Prob. 6MC Ch. 17 - Prob. 7MC Ch. 17 - Prob. 8MC Ch. 17 - Prob. 9MC Ch. 17 - Prob. 10MC Ch. 17 - True or False: If data is sorted in ascending...Ch. 17 - True or False: If data is sorted in descending...Ch. 17 - Prob. 13TF Ch. 17 - Prob. 14TF Ch. 17 - Assume this code is using the IntBinarySearcher...Ch. 17 - Prob. 1AW Ch. 17 - Prob. 1SA Ch. 17 - Prob. 2SA Ch. 17 - Prob. 3SA Ch. 17 - Prob. 4SA Ch. 17 - Prob. 5SA Ch. 17 - Prob. 6SA Ch. 17 - Prob. 7SA Ch. 17 - Prob. 8SA Ch. 17 - Prob. 1PC Ch. 17 - Sorting Objects with the Quicksort Algorithm The...Ch. 17 - Prob. 3PC Ch. 17 - Charge Account Validation Create a class with a...Ch. 17 - Charge Account Validation Modification Modify the...Ch. 17 - Search Benchmarks Write an application that has an...Ch. 17 - Prob. 8PC Ch. 17 - Efficient Computation of Fibonacci Numbers Modify...

Knowledge Booster

Similar questions

ARRAY RANDOMIZER Create a program that shuffels all the elements present in an array. To shuffle an array, you need to do at least 500 random swaps of any elements in the array given below. Print the shuffled array in the output. {12, 54, 22, 100, -3, 5, 10, -33, 78, 90, 29, -45, 77, -9, 19, 21} Language: CPP
one-dimensional array: Write the needed code to swap between the first element and last element in array intArray.
Data in an array that is only half full might be difficult to keep track of.

Recommended textbooks for you

Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning