public void get(int key) {
		HashPrinter.tryGet(key);

		/** Run along the array */
		int runner = 0;

		int hash = (key % TABLE_INITIAL_SIZE);

		int secondValue = TABLE_INITIAL_SIZE;

		while (table[hash] == null || (table[hash] != null && (table[hash].getKey() != key)) && runner < TABLE_INITIAL_SIZE) {

			runner++;

			secondValue = secondFunction(runner);

			hash = firstFunction(key, secondValue);

			/** 2 = smaller prime number = stop criteria */
			if (secondValue == 2) {

				break;

			}

		}

		if (runner >= TABLE_INITIAL_SIZE || (table[hash] != null && table[hash].getKey() != key && secondValue == 2)) {

			HashPrinter.notFound(key);

		} else {

			HashPrinter.found(table, key, hash);

		}

	}