public class LinearProbingHashTable<K,V> implements HashTable<K,V>{
	 
	private K keys[];
	private V values[];
	private int size;
	private double maxLoadFactor;
...
...
       /** 
	 * Takes key of association and returns
	 * its insertion position in the table.
         * Collisions must be resolved using linear probing algorithm)
	 */
	private int searchIdx(K key) {
		// to be completed
		int idx = hash(key);
		while(!(keys[idx] == null)) {
			if(keys[idx] == key){
				return idx;
			} else {
				idx++;
			}
		}
		return null;
	}