e2p3.java

class LLNode {
	String key, value;
	int hashCode;
	LLNode next;
	LLNode(String k, String v, int h, LLNode n){
		key = k; value = v;
		hashCode = h;
		next = n;
	}
}

class Hashtable {
	LLNode[] table;
	int numValues;
	float loadFactorThreshold;
	Hashtable(float loadFactorThreshold){
		table = new LLNode[10];
		this.loadFactorThreshold = loadFactorThreshold;
	}
	public void insert(String key, String value){
		int h = key.hashCode(), i = h%table.length;
		if(i < 0)i += table.length;
		table[i] = new LLNode(key, value, h, table[i]);
		if((double)++numValues/table.length > loadFactorThreshold){
			rehash();
		}
	}
	public void rehash(){
		LLNode[] tmp = new LLNode[table.length*2];
		for(LLNode head : table){
			while(head != null){
				LLNode next = head.next;
				int i = head.hashCode%tmp.length;
				if(i < 0)i += tmp.length;
				head.next = tmp[i];
				tmp[i] = head;
				head = next;
			}
		}
		table = tmp;
	}
}

public class e2p3 {
	
	public static void main (String args[]) {
		String[] values = {
			"Winter",
			"was",
			"rudely",
			"interrupted",
			"by",
			"a",
			"cacophonous",
			"buzzing",
			"He",
			"falling",
			"the",
			"continued",
			"until",
			"he",
			"hit",
			"offending",
			"alarm",
			"clock",
			"with",
			"respectable",
			"gusto",
			"Its"
		};
		Hashtable ht = new Hashtable(2.0f);
		for(String value : values){
			ht.insert(value, value);
		}
		for(LLNode head : ht.table){
			while(head != null){
				System.out.println(head.value);
				head = head.next;
			}
		}
	}
}