See method fasterLinSearch() below. This method implements the linear search algorithm to search list for key. However, unlike the usual linear search algorithm, fasterLinSearch() attempts to find key more quickly by performing two comparisons of a list element to key during each pass of the loop. In particular, it compares the elements at indices n and list. size() - 1 - n to key each time through the loop. If key is equal to one of these two list elements, then the corresponding list index is returned. The question is: what is(are) the key operation(s) in this algorithm? public int fasterLinSearch ArrayList Integer list, Integer key)
{ for (int n = 0; n <= list. size() / 2; ++n) {
if (list. get(n).equals(key)) {
return n;
} else if (list. get(list. size() 1 - n).equals(key)) {
return list. size() - 1 - n;
}
}
return -1;
}
return list. size() - 1 - n;
list. get (list. size() 1 n).equals (key) n
++n n
list. get (n) U
n <= list. size() / 2
list. get(n).equals (key)
list. get (list. size() - 1 - n)
return -1;
return n; n
public int fasterlinSearch (ArrayList list, Integer key)