Want to sort HashMap based on Values with duplicate values

Question

Hi. I have a requirement to sort the HashMap based on the values not on the keys. My HashMap contains the values which are duplicates. My program is some thing like this.
Map m = new HashMap();
m.put ("Gosling", new Integer(2000));
m.put ("Joy", new Integer(2000));
m.put ("Schwartz", new Integer(3000));
m.put ("Bracha", new Integer(4000));
m.put ("Gafter", new Integer(3000));
still i need to sort HashMap based on the values. How can i do it. I want the output some like this.
Gosling 2000
joy 2000 (may be interchanged)
Schwartz 3000
Gafter 3000 (Same as above)
Bracha 4000
Thanks.

Answer 1

I found syntactical problems with above mentioned code.
Here is edited working version:
* test sortMap
public void testSortMap () {
     Map m = new HashMap();
     m.put ("IGGHHG", new Integer(232353453));
     m.put ("ASDF", new Integer(345555000));
     m.put ("DSF", new Integer(345555000));
     m.put ("XYZ", new Integer(45555555));
     m.put ("AAA", new Integer(0));
     ArrayList outputList = sortMap(m);
     int count = 0;
     count = outputList.size();
          while(count > 0) {
               Map.Entry entry = (Map.Entry) outputList.get(--count);
               System.out.print("Key:" + entry.getKey());
               System.out.println("\tValue:" + entry.getValue());
* This method will use Arrays.sort for sorting Map
* @param map
* @return outputList of Map.Entries
public ArrayList sortMap(Map map) {
     ArrayList outputList = null;
     int count = 0;
     Set set = null;
     Map.Entry[] entries = null;
//     Logic:
//     get a set from Map
//     Build a Map.Entry[] from set
//     Sort the list using Arrays.sort
// Add the sorted Map.Entries into arrayList and return
     set = (Set) map.entrySet();
     Iterator iterator = set.iterator();
     entries = new Map.Entry[set.size()];
     while(iterator.hasNext()) {
          entries[count++] = (Map.Entry) iterator.next();
//     Sort the entries with your own comparator for the values:
     Arrays.sort(entries, new Comparator() {
     public int compareTo(Object lhs, Object rhs) {
     Map.Entry le = (Map.Entry)lhs;
     Map.Entry re = (Map.Entry)rhs;
     return ((Comparable)le.getValue()).compareTo((Comparable)re.getValue());
          public int compare(Object lhs, Object rhs) {
     Map.Entry le = (Map.Entry)lhs;
     Map.Entry re = (Map.Entry)rhs;
     return ((Comparable)le.getValue()).compareTo((Comparable)re.getValue());
          outputList = new ArrayList();
          for(int i = 0; i < entries.length; i++) {
               outputList.add(entries);
     return outputList;
     }//End of sortMap