Run the following applet that searches a list
of 1000 positive integer values looking for a given value. Theoretically, the range of values is
between 0 and 999. Run the applet
as many times as it takes to discover the actual range (lower limit and upper
limit) of the data in the list.
Record the range.
Run the applet as many times as it takes to
find five items that are in the list and five items within the range that are
not in the list. Record the items you used along with the number of comparisons
it took to either find the item or determine that the item was not in the list.
You may combine the results from the range question here if you wish.
The algorithm used here is the same one used in the previous exercise, but the
results are different. Describe the difference. Can you hypothesize why this
might be?