public void get(int key) {

		int level = 0;

		HashPrinter.tryGet(key);

		int hash = (key % TABLE_INITIAL_SIZE);

		boolean found = false;

		if (table[hash] != null) {

			Node entry = table[hash];

			while (entry != null) {

				if (entry.getKey() == key) {

					found = true;

					break;

				}

				if (entry != null) {

					entry = entry.getNext();

				}

				level++;
			}

			if (found) {

				HashPrinter.found(level, entry, key, hash);

			} else {

				HashPrinter.notFound(key);

			}

		}

	}