Descending order for integers not working

Recuerda lo que te esta pidiendo el programa ORDENA los números del teclado en manera descendente, yo no utilice matrices, ya que es un tema al que aun no tocamos, y para mayor reto solo me rehusó a utilizar cosas que aun no vemos, entonces simplemente cada variable verifica cuál es el menor, y las cambias de posiciones guardando el valor menor en una variable temporal.

if (n1 < n2) {
          int temp = n1;
          n1 = n2;
          n2 = temp;
      }

Después comparas el n1 con n3 y la comparacion faltante n2 y n3 PD: utiliza puras if, no utilices ni else if o else

#1 The first code does not work because Collections.reverseOrder() works by calling the compareTo() method on items in the collection and primitives, such as int, do not have this method. The code would work with an Integer[] array instead of an int[] array. Here is some example code:

int five = 5;
Integer six = 6;

six.compareTo(five);

//~! ERROR: primitive types do not have compareTo()
five.compareTo(six);

Integer[] array1 = {54, 1,15,4, 8};
Arrays.sort(array1, Collections.reverseOrder());
System.out.println(Arrays.toString(array1));

int[] array2 = {54, 1,15,4, 8};

//~! ERROR: array2 is not compatible with Collections because it is an Array of primitives
Arrays.sort(array2, Collections.reverseOrder());

System.out.println(Arrays.toString(array1));

The code will not run unless you comment out the two lines that have the errors. #2 Your code using a String[] did not word because Strings sort alphabetically. This means it takes each character from left to right and sorts in turn. If you entered the three numbers ["4", "82", "165"] and sort them the result would be in alphabetical order: ["164", "4", "82"]. It may help if you think of each digit as the corresponding letter in the alphabet. So 4 would be "d". 8 would be "h" and 2 would be "b" which would make 82 equal to "hb". 165 would equal "afe". If you sorted ["d", "hb", "afe"] the result would be ["afe", "d", "hb"] (the same order the numbers sorted).

After an hour, solved in this way: import java.io.*; import java.util.*; import java.util.Arrays; import java.util.Scanner; public class Solution { public static void main(String[] args) throws Exception { Scanner scanner = new Scanner(System.in); int [] arr = new int [3]; for (int i = 0; i < arr.length; i++){ arr[i] = scanner.nextInt(); } Arrays.sort(arr); for (int i = arr.length-1; i>=0 ; i--){ System.out.print(arr[i] + " "); } } }

The String code was this, but I dont think that's a good solution: import java.io.*; import java.util.*; import java.util.Arrays; import java.util.Collections; import java.util.Scanner; public class Solution { public static void main(String[] args) throws Exception { Scanner scanner = new Scanner(System.in); String [] arr = new String[3]; for (int i = 0; i < arr.length; i++){ arr[i] = scanner.nextLine(); } Arrays.sort(arr, Collections.reverseOrder()); for (int i = 0; i < arr.length; i++){ System.out.print(arr[i] + " "); } } }