@Override
	public void delete(Key key)
	{
		int i = hash(key);
		if (st[i].contains(key)) // Note: More efficient using than
									// contains(key) as
									// duplicate calculation of hash(key) not
									// involved
			N--;
		st[i].delete(key);

		if (M > INIT_CAPACITY && N <= 2 * M)
			resize(M / 2);
	}