Answer:
it’s just a screenie hope it helps
Answer:
algorithm
Explanation:
A(n) algorithm for a computer program is a set of steps that explains how to begin with known information specified in a problem statement and how to manipulate that information to arrive at a solution.
Answer:
n/2 times
Explanation:
The number of times a sequential search function will have to read the array in other to locate a specific value is : n/2 times
In an average case to locate a specific value using the a sequential/linear search the elements of the array will be searched in other to get a specific value and this will take n/2 number of attempts/times.
a sequential search is used to search for a value contained in a data set that has a linear relationship with other values contained in the data set
