View difference between Paste ID: 93w7nzEr and 9spndMKP

 package ch.fhnw.claudemartin;
 
 import java.util.ArrayList;
 import java.util.Arrays;
-import java.util.Comparator;
+
 import java.util.List;
-import java.util.stream.Collectors;
+import java.util.Map;
 import java.util.Map.Entry;
 import java.util.TreeMap;
 
 public class SomeClass {
 
   public static void main(final String[] arrg) {
     final int[] arr = { 2, 5, 2, 8, 5, 6, 8, 8 };
     System.out.println(Arrays.toString(sortByFrequency(arr)));
   }
-    final List<Integer> list = Arrays.stream(input).boxed().collect(Collectors.toList());
+
-    final Comparator<Integer> comp = (a,b) -> Integer.compare(Collections.frequency(list, b), Collections.frequency(list, a));
+
-    return Arrays.stream(input).distinct().boxed().sorted(comp).mapToInt(i -> i).toArray();
+    final Map<Integer, Integer> map = new TreeMap<Integer, Integer>();
     for (final int i : input) {
       if (map.get(i) == null) {
         map.put(i, 1);
       } else {
         int count = map.get(i);
         map.put(i, ++count);
       }
     }
 
     final List<Entry<Integer, Integer>> list = new ArrayList<>(map.entrySet());
     list.sort(Collections.reverseOrder(Entry.comparingByValue()));
     return list.stream().mapToInt(e -> e.getKey()).toArray();
 
   }
 
 }