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

(1 point) By dragging statements from the left column to the right column below, give a proof by induction of the following statement: an = = 9" - 1 is a solution to the recurrence relation an = 9an-18 with ao = : 0. The correct proof will use 8 of the statements below. Statements to choose from: Note that a₁ = 9a0 + 8. Now assume that P(n) is true for all n ≥ 0. Your Proof: Put chosen statements in order in this column and press the Submit Answers button. Let P(n) be the predicate, "a = 9″ – 1". απ = 90 − 1 = Note that Let P(n) be the predicate, "an 9" - 1 is a solution to the recurrence relation an = 9an-1 +8 with ao = 0." - Now assume that P(k + 1) is true. Thus P(k) is true for all k. Thus P(k+1) is true. Then ak+1 = 9ak +8, so P(k + 1) is true. = 1 − 1 = 0, as required. Then = 9k — 1. ak Now assume that P(k) is true for an arbitrary integer k ≥ 1. By the recurrence relation, we have ak+1 = ak+1 = = 9ak + 8 = 9(9k − 1) + 8 This simplifies to 9k+19+8 = 9k+1 − 1 Then 9k+1 − 1 = 9(9*…

Given the following request to an AI chatbot, which response is more accurate? (You should use Google to verify that the factual claims in each response are accurate.) Prompt Is this true? The first recorded use of the phrase "when pigs fly" in print is in a 1616 play by Ben Jonson called "The Devil is an Ass," in which a character says, "When pigs fly, good-night!!" Response Response A Response B Yes, that's true! The phrase "when pigs fly" indeed appears in Ben Jonson's 1616 play The Devil is an Ass and was said during the second act in a conversation between Fitzdottrel and Pug. The phrase was first used to express skepticism or disbelief, suggesting that something is as unlikely to happen as the fanciful idea of pigs flying. This usage is often cited as one of the earliest instances of the phrase in print. The claim that the phrase "when pigs fly" was first recorded in Ben Jonson's 1616 play "The Devil is an Ass" is not accurate. There is no evidence from the…

This is for my Computer Organization & Assembly Language Class