public void InsertToHashMap() {
		int curKey;
		for (int i = 0; i < arrayLen; i++) {
			curKey = originalArray[i];
			// if originalArray[i] is duplicate, then the LinkedList for its
			// hash key should already exist;
			if (mappedArray.containsKey(curKey)) {
				LinkedList<Integer> existElements = mappedArray.get(curKey);
				// check if it's really duplicate or it's just in same bucket
				// after hash function
				if (!existElements.contains(curKey)) {// if it's not really
														// duplicate
					existElements.add(curKey);
				} else {// if it's duplicate, reset this value in originalArray
						// to be 0; so it would not be used later
					originalArray[i] = 0;
				}
			} else { // else, create new linkedlist, put current value in and
						// put in hashmap;
				LinkedList<Integer> elements = new LinkedList<Integer>();
				elements.add(curKey);
				mappedArray.put(curKey, elements);
			}
		}
	}