Sorting a HashTable

Question

I am trying to sort a HashTable accoring to values . But i am getting compilation errors on
String hasKey =(String) entries.getKey();
String siteDesc =(String)entries.getValue();
The Error is cananot resolve symbol getKey and getValue.
The follwing is the code.
import java.util.*;
public class HashSort
     public static void main(String as[])
          Map ht = new Hashtable();
          ht.put("ABC", "1");
          ht.put("XYZ", "1");
          ht.put("MNO", "0");
          Set set = ht.entrySet();
          Map.Entry [] entries = (Map.Entry[])set.toArray(new Map.Entry[set.size()]);
          Arrays.sort(entries, new Comparator()
          public int compare(Object o1, Object o2)
               Object v1 = ((Map.Entry)o1).getValue();
               Object v2 = ((Map.Entry)o2).getValue();
               return ((Comparable)v1).compareTo(v2);
          for(int i=0; i<entries.length; i++)
               String hasKey =(String) entries.getKey();
               String siteDesc =(String)entries.getValue();
rgards
AShok

Answer 1

I think you mean TreeMap instead of TreeSet.
Sorting the contents of the Hashtable has no effect on the Hashtable.
The TreeMap sorts the elements for you. However if you where to so the same sorting code, it would not alter the TreeMap and thus the time to search the TreeMap would be uneffected.