The list is sorted, but then you put it in a "sorted" map. However, HashMap is not sorted, and it will never be sorted. There is currently only one map that is sorted, and that is TreeMap.
The problem is that any comparator for a TreeMap needs a reference to the TreeMap to be able to sort it. However, it needs to provide the comparator to the TreeMap constructor, so you can't put a reference to the TreeMap right away.
The following may work (I haven't tested it):
The TreeMapComparator should be a static nested class in your current class; its definition is not needed outside of it, only the fact that it is a Comparator.
Edit: of course you can use a LinkedHashMap; that keeps the insertion order. It won't stay ordered if you put new items though, but I'm not quite sure my above solution will handle that well.
You will have seen from the earlier posts that it is impossible to sort a hash map. What you are doing is sort a List and then finding the Map.Entry in the Map with the corresponding “V”. What you are actually doing is sorting a List<String>, which is a completely different task.
By the way: Why are you using a Comparator to sort something which already implements Comparable?
Arun Singh Raaj
posted 1 year ago
Ya, it is true that Map cannot be sorted by values straight.
And you are right, it could have been done by implementing Comparable interface to the Employee, But i actually had a case in my mind that if the 'value' of the map object is user-defined type then you could have had Comparator implemented.
By the way, if i had the requirement to sort Map by value then does my way of converting Map values into List then finding it through the EntrySet, slow down the performance?
posted 1 year ago
Arun Singh Raaj wrote:. . . does my way of converting Map values into List then finding it through the EntrySet, slow down the performance?
What do you think? Look at how many loops you have written.