salcosser / algorithms-cmpt435 Goto Github PK

for (int i = 0; i < chosenLen; i++) {
	int count = 0;

	int hashLoc = getHash(items[i]);
	Queue chain = table[hashLoc];
		
	Node  *n = chain.head;
		std::cout << n->data << std::endl;
		if (n->data == "")
		{
			std::cout << "If you're seeing this, the list is empty." << std::endl;
			
		}
		else
		{
			while (n->data != items[i])
			{
				count++;
				n = n->next;
			}
			std::cout << "Found it at place " << ++count << " in the chain." << std::endl;
			tCount += count;

		}
	}
return tCount;
}`