Program to Sort Map by key in Ascending order by implementing Comparator interface and overriding its compare method

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
class SortByKeyAscending implements Comparator<Map.Entry<Integer, Integer>>{
   public int compare( Map.Entry<Integer,Integer> entry1, Map.Entry<Integer,Integer> entry2){
       return (entry1.getKey()).compareTo( entry2.getKey() );

* @author AnkitMittal
* Copyright (c), AnkitMittal
* Main class
public class SortMapByKeyAscending {
   public static void main(String...a){
       Map<Integer, Integer> map = new LinkedHashMap<Integer, Integer>();
       map.put(4, 1);
       map.put(2, 1);
       map.put(3, 1);
       map.put(5, 1);
       Set<Entry<Integer, Integer>> entrySet = map.entrySet();
       List<Entry<Integer, Integer>> listOfentrySet = new ArrayList<Entry<Integer, Integer>>(entrySet);
       System.out.print("Before sorting by key : ");
       for(Map.Entry<Integer, Integer> entry:listOfentrySet){
        System.out.print(entry.getKey()+"="+entry.getValue()+"  ");
       Collections.sort(listOfentrySet, new SortByKeyAscending());
       System.out.print("\nAfter sorting by key(ascending): ");
       for(Map.Entry<Integer, Integer> entry:listOfentrySet)
        System.out.print(entry.getKey()+"="+entry.getValue()+"  ");
Before sorting by key : 4=1  2=1  3=1  5=1
After sorting by key(ascending): 2=1  3=1  4=1  5=1
Note : In the above program, only listOfentrySet obtained from map contain entry (key-value) pairs sorted on basis of keys, map is not sorted on basis of keys. We will learn sorting of map in Program 3 and Program 4 below.

Must read for you :