Pleas help with array

[Ronald Pruitt]

I am working on an assignment that is to make a heap from an array. One thing I must do is if an item is already in the array it is not to be added again, but the value only to be incremented. I have had limited success in that I can get it to increment but the word is also added to the list. Also, when I place the first to values in the list they automatically increment, but elements after that do not. Can anyone help please.

public void insert(WordElem val) 
{                                                         // Insert value into heap
  Assert.notFalse(n < size, "Heap is full");
  int curr = n++;
  Heap[curr] = val;                 // Start at end of heap
  // Now sift up until curr's parent's key > curr's key
for (int i = 0; i < n; i++)
if (Heap[i].getKey().equals(val.getKey()))
{
Heap[i].incCount();
curr--;

}
else
  while ((curr!=0) && (Heap[curr].getCount()>Heap[parent(curr)].getCount())) 
{
    DSutil.swap(Heap, curr, parent(curr));
    curr = parent(curr);
  }
}

in the test bed I have the following:

WordElem[] A = new WordElem[10]; // Declare some test arrays

MyHeap testit = new MyHeap(A, 0, 10);
testit.insert(A[0] = new WordElem("dog", 1));

which when I ask it to print gives me;
The Heap values are: 1 = (Key-> dog, Count -> 2)

[Ronald Pruitt]

I've continued trying to work on this but to no avail, can anyone help, please

[Frank Carver]

I'm a little puzzled as to why you are doing this. Would a Map (such as a Hashtable or HashMap) not serve the purpose?
Consider:

import java.util.*;
 
/**
 run using java Ugh name name name ...
 A map is built of the names and the number of times each was typed, so
 (for example) 
   a b c a d e f b a
 would give
   a=3 b=2 c=1 d=1 e=1 f=1
*/
public class Ugh
{
  private static Map map = new HashMap();
  
  public static void main(String[] args)
  {
  for (int i = 0; i < args.length; ++i)
{
  int count = 0;
  if (map.containsKey(args[i]))
  {
    count = ((Integer)map.get(args[i])).intValue();
  }
  
      map.put(args[i], new Integer(count+1));
}

Iterator it = map.keySet().iterator();
while(it.hasNext())
{
  Object key = it.next();
  System.out.print(key + "=" + map.get(key) + " ");
}
System.out.println();
  }
}