Array: An array is defined as a group that consists of similar data types. The array size must be specified by an “int” value and not long or short. In Java, all arrays are allocated dynamically. An array is always indexed, starting from 0. Binary Search: Binary search algorithm ’s strategy: The binary search algorithm is used to find an item in an array. The algorithm assumes that the item search array is sorted. The searching process starts at 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 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 the search item, then the searching process is stopped. The search is stopped when an item is found or the search reaches the empty portion of the array.

Question

Want to see the full answer?

Answer 1

Question

Chapter 7.10, Problem 7.10.3CP

Program Plan Intro

Array:

An array is defined as a group that consists of similar data types.

The array size must be specified by an “int” value and not long or short.

In Java, all arrays are allocated dynamically.

An array is always indexed, starting from 0.

Binary Search:

Binary search algorithm’s strategy:

The binary search algorithm is used to find an item in an array.

The algorithm assumes that the item search array is sorted.

The searching process starts at 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 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 the search item, then the searching process is stopped.

The search is stopped when an item is found or the search reaches the empty portion of the array.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

I would like to get help to resolve the following case

Last Chance Securities The IT director opened the department staff meeting today by saying, "I've got some good news and some bad news. The good news is that management approved the payroll system project this morning. The new system will reduce clerical time and errors, improve morale in the payroll department, and avoid possible fines and penalties for noncompliance. The bad news is that the system must be installed by January 1st in order to meet new federal reporting rules, all expenses from now on must be approved in advance, the system should have a modular design if possible, and the vice president of finance would like to announce the new system in a year-end report if it is ready by mid-December." Tasks 1. Why is it important to define the project scope? How would you define the scope of the payroll project in this case? 2. Review each constraint and identify its characteristics: present versus future, internal versus exter- nal, and mandatory versus desirable. 3. What…

2. Signed Integers Unsigned binary numbers work for natural numbers, but many calculations use negative numbers as well. To deal with this, a number of different methods have been used to represent signed numbers, but we will focus on two's complement, as it is the standard solution for representing signed integers. 2.1 Two's complement • Most significant bit has a negative value, all others are positive. So, the value of an n-digit -2 two's complement number can be written as: Σ2 2¹ di 2n-1 dn • Otherwise exactly the same as unsigned integers. i=0 - • A neat trick for flipping the sign of a two's complement number: flip all the bits (0 becomes 1, or 1 becomes 0) and then add 1 to the least significant bit. • Addition is exactly the same as with an unsigned number. 2.2 Exercises For questions 1-3, answer each one for the case of a two's complement number and an unsigned number, indicating if it cannot be answered with a specific representation. 1. (15 pts) What is the largest integer…