1function sortEggsInNest(a, b) {
2  return a > b ? -1 : b > a ? 1 : 0;
3}

1Array -- Sort Descending
2Write a return method that can sort an int array in descending order without using the sort method of the Arrays class
3Ex:  int[] arr = {10,20,7, 8, 90};
4                 arr = Sort(arr);  ==>  {90, 20, 10, 8, 7};
5 
6Solution 1:
7public static void main(String[] args) {
8    ArrayList<Integer> arr = new ArrayList<Integer>(5);
9    arr.add(12);arr.add(4);arr.add(6);arr.add(8);arr.add(20);
10    System.out.println(findMin(arr));
11public static int[] Sort(int[] a) {
12ArrayList<Integer> list=new ArrayList<Integer>();
13for(int each: a)
14list.add(each);
15 
16for(int i=0; i < a.length; i++) {
17a[i] = findMax(list);
18list.remove(Integer.valueOf(a[i]));
19}
20return a;
21}
22 
23public static int findMax(ArrayList<Integer> a) {
24int max=Integer.MIN_VALUE;
25for(int each: a)
26max = Math.max(max, each);
27return max;
28}
29 
30Solution 2:
31public static void main(String[] args) {
32    ArrayList<Integer> arr = new ArrayList<Integer>(5);
33    arr.add(12);arr.add(4);arr.add(6);arr.add(8);arr.add(20);
34    System.out.println(findMin(arr));
35
36public static void SortingArrayDesc(int[] arr) {
37ArrayList<Integer> list = new ArrayList();
38for(int each: arr) {
39list.add(each);
40}
41for (int i = 0; i < list.size(); i++) {
42            for (int j = 0; j < list.size(); j++) {
43            if (list.get(i) > list.get(j)) {
44                    Integer temp = list.get(i);
45                    list.set(i, list.get(j));
46                    list.set(j, temp);
47            }
48              }
49}
50for(int i=0; i < list.size(); i++) {
51arr[i] = list.get(i);
52}
53}