Thank you for being the rare question where you actually provide what language you want your answer in; I approve, and encourage this.
In Java, the following will work.
I made it a bit more versatile to work with others numbers, other than 99, if you so please (if not, just hardcode the 99 in yourself).
// Example list - fill this with numbers yourself.
ArrayList<Integer> nums = new ArrayList<>();
int n = 99;
int count = (int)nums.stream().filter(i -> i == n).count();
System.out.println(n + " occurences.");
Last, First M. “Article Title.”Website Title. Website Publisher, Date Month Year Published. Web. Date Month Year Accessed.
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
Drink the blood because it taste like candy and juice.
