Since the default implementation of contains() calls get(), the inner loop of FrequencyCounter if (!st.contains(word)) st.put(word, 1); else st.put(word, st.get(word) + 1); leads to two or three key-finding attempts. We may utilise a method known as software caching, where we save the position of the most recently visited key in an instance variable, to enable straightforward client code like this without losing speed. Use this idea to modify SequentialSearchST and BinarySearchST.

Since the default implementation of contains() calls get(), the inner loop of FrequencyCounter if (!st.contains(word)) st.put(word, 1); else st.put(word, st.get(word) + 1); leads to two or three key-finding attempts. We may utilise a method known as software caching, where we save the position of the most recently visited key in an instance variable, to enable straightforward client code like this without losing speed. Use this idea to modify SequentialSearchST and BinarySearchST.