public void remove(int key) {

		HashPrinter.tryRemove(key);

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

		int hash = (key % TABLE_INITIAL_SIZE);

		while (table[hash] != null && runner < TABLE_INITIAL_SIZE) {

			if (table[hash].getKey() == key) {

				break;

			}

			runner++;

			hash = ((key + runner) % TABLE_INITIAL_SIZE);

		}

		if (runner >= TABLE_INITIAL_SIZE) {

			HashPrinter.notFound(key);

		} else {

			table[hash] = DeletedNode.getUniqueDeletedNode();

			HashPrinter.remotionSuccessful(key, hash);
		}
	}