I would say because it is hard to remember. Unless each one of those stands for a world, kind of like an acronym, then good luck remembering it!
It would B, because anytime you search it always pulls up google search engine.
Answer:
int k=0;
for(int i=0;i<=13; i++)
{
if (table[i].getKey().equals(key))
{
k=i;
}
else
{
continue;
}
}
V value= table[k].getValue();
return value;
}
Explanation:
Note table[i] is an entry, and we know the key as it is an argument input to the function. Hence, we find the entry position using the given key, and then find the corresponding value and return it. And this is what is required. There are 14 entries in this hashtable, as known from the question.
