Question

I only need help with question 5! Thank you!

Question 4 4 pts Consider this variant of the linear search algorithm which attempts to speed up the search by reducing the number of iterations of the for loop by approximately one-half. During each pass of the loop, the algorithm performs two comparisons rather than one comparison as in linear Search(). The two comparisons compare the elements at indices i and pList size() - 1-i to pKey for equality. If a match is found, either the index ior plist.size() - 1-i is returned. publie in linearSearch2 ArrayList Integer pList. Integer pkey for (int 1 - 0 1 - plist.size 2: ++1) 1 (plast.get(1).equals(pkey) return 1: ) else 1 (pList.get(plist.size()- 1 - 1).equals(pRey) return plist.size() - 1 - : return -1; Identify the key operation or key operations (there may be more than one) public int near Searcha (ArrayListinteger pliat, Integer pkey)

Answer 1

$\color{blue}\underline{Answer:}$

f(n) = n