Answer:
Following are the response to the given question:
Explanation:
The glamorous objective is to examine the items (as being the most valuable and "cheapest" items are chosen) while no item is selectable - in other words, the loading can be reached.
Assume that such a strategy also isn't optimum, this is that there is the set of items not including one of the selfish strategy items (say, i-th item), but instead a heavy, less valuable item j, with j > i and is optimal.
As 
, the i-th item may be substituted by the j-th item, as well as the overall load is still sustainable. Moreover, because 
and this strategy is better, our total profit has dropped. Contradiction.
Define variables
left is l
right is r
Ask input
left or right
Ask input value
Equate l or r to the input value
Show ladder with steps equal to input value and in the side of input variable
The programming model that is distinct from the others discussed because it focuses on the data, or object, rather than the logic, or function is object-oriented programming.
Given the way computers go about completing a linear search for an array of numbers, we can confirm that it would take about six steps to complete the search.
<h3>How do computers perform a linear search?</h3>
When given an array of numbers to search through the linear search method, the computer will follow a logical approach. It will begin at the leftmost number, in this case, the number 7, and then compare each number in the array to the number 52, one by one. When the number finally matches the parameter it is searching for, it will return the answer.
Since in this series of numbers, 52 is the fifth number, the computer will go through the 5 initial steps of comparing each number, and then complete the search with the sixth step which would be returning the index of 52.
Therefore, we can confirm that it would take about six steps for the computer to complete the search using a linear search.
To learn more about linear searches visit:
brainly.com/question/15178888?referrer=searchResults
