Search Benchmarks Program Plan: Include the required header files. Declare the necessary function prototype and constants. Define the main () function. Declare the necessary variables. Declare and define the array values. Get the number that is to be searched from the user. Call the function “searchlinear()” to perform linear search and count the number of comparisons made during the search. Display the number of comparison made by the linear search. Call the function “searchbinary()” to perform binary search and count the number of comparisons made during the search. Display the number of comparison made by the binary search. Define the “searchlinear()” method, Declare the necessary variables Use a loop that iterates for the elements that is present in the array. A counter variable that gets incremented is used inside the loop to count the number of comparison made to find the target element. A condition statement is used to compare the values of the array and the search element. Return the count of the comparisons made. Define the “searchbinary()” method, Declare the necessary variables. A loop that iterates to search the elements those are present in the array. A counter variable that gets incremented to count the number of comparison that is being made. A condition statement that validates the position of the search element in the array. Based on the position of the array the search is performed with the count of the comparison that is made. Return the count of the comparison made.

Question

Want to see the full answer?

Answer 1

Question

Chapter 9, Problem 7PE

Program Plan Intro

Search Benchmarks

Program Plan:

Include the required header files.

Declare the necessary function prototype and constants.

Define the main () function.

Declare the necessary variables.

Declare and define the array values.

Get the number that is to be searched from the user.

Call the function “searchlinear()” to perform linear search and count the number of comparisons made during the search.

Display the number of comparison made by the linear search.

Call the function “searchbinary()” to perform binary search and count the number of comparisons made during the search.

Display the number of comparison made by the binary search.

Define the “searchlinear()” method,

Declare the necessary variables

Use a loop that iterates for the elements that is present in the array.

A counter variable that gets incremented is used inside the loop to count the number of comparison made to find the target element.

A condition statement is used to compare the values of the array and the search element.

Return the count of the comparisons made.

Define the “searchbinary()” method,

Declare the necessary variables.

A loop that iterates to search the elements those are present in the array.

A counter variable that gets incremented to count the number of comparison that is being made.

A condition statement that validates the position of the search element in the array.

Based on the position of the array the search is performed with the count of the comparison that is made.

Return the count of the comparison made.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

A cylinder of diameter 10 cm rotates concentrically inside another hollow cylinder of inner diameter 10.1 cm. Both cylinders are 20 cm long and stand with their axis vertical. The annular space is filled with oil. If a torque of 100 kg cm is required to rotate the inner cylinder at 100 rpm, determine the viscosity of oil. Ans. μ= 29.82poise

Make the following game user friendly with GUI, with some simple graphics The following code works as this: The objective of the player is to escape from this labyrinth. The player starts at the bottom left corner of the labyrinth. He has to get to the top right corner of the labyrinth as fast he can, avoiding a meeting with the evil dragon. The player can move only in four directions: left, right, up or down. There are several escape paths in all labyrinths. The player’s character should be able to moved with the well known WASD keyboard buttons. If the dragon gets to a neighboring field of the player, then the player dies. Because it is dark in the labyrinth, the player can see only the neighboring fields at a distance of 3 units. Cell Class: public class Cell { private boolean isWall; public Cell(boolean isWall) { this.isWall = isWall; } public boolean isWall() { return isWall; } public void setWall(boolean isWall) { this.isWall = isWall; } @Override public String toString() {…

Please original work What are four of the goals of information lifecycle management think they are most important to data warehousing, Why do you feel this way, how dashboards can be used in the process, and provide a real life example for each. Please cite in text references and add weblinks