Answer:
It's due to damage of goods
Answer:
The "Value" variable contains the lowest value of array1 list.
Explanation:
- When the user passes the value on the array, then the above code is used to find the minimum value from the list of value which is passed by the user.
- The above array has the 25 sizes, so it will take only 25 value from the user, Then the loop will assume the first value as the minimum value and assign that value on the variable "value".
- Then all the other elements accessed by the for loop and compare with the value of Value variable if the array value is minimum, then that value is assigned on the variable value.
- Hence the minimum value of the list will be assigned on the variable value.
Answer:
What does Bob [1] return?
What about Bob[-2]?
What about Bob[1:-1]?
How to get the length of Bob?
Explanation:
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
Answer:
strr=input("please enter something: ")
while strr is not "":
print(strr)
strr=input("please enter something: ")
Explanation:
whenever the user will enter an empty string the loop will terminate
