diviser un nombre en chiffrer et trier ascending order et...

import java.util.*;
import java.io.*;
import java.math.*;

/**
 * Auto-generated code below aims at helping you parse
 * the standard input according to the problem statement.
 **/
class Solution {

    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        int s = in.nextInt();
        s = ascendingOrder(s);
        s = discendingOrder(s);
        //System.out.println(s);
        //System.out.println("answer");
    }
    public static int ascendingOrder(int number)
    {
        List<Integer> list = new ArrayList<>();
        int retour = 0;
        while(number != 0)
        {
            list.add(number%10);
            number/=10;
        }
        Integer[] tab = list.toArray(new Integer[list.size()]);
        bubbleSort(tab);
        for(int i = 0; i < tab.length; i++)
        {
            retour *=10;
            retour += tab[i];
        }
        return retour;

    }
    public static int discendingOrder(int number)
    {
        List<Integer> list = new ArrayList<>();
        int retour = 0;
        while(number != 0)
        {
            list.add(number%10);
            number/=10;
        }
        Integer[] tab = list.toArray(new Integer[list.size()]);
        bubbleSort(tab);
        for(int i = tab.length-1; i >= 0; i--)
        {
            retour *=10;
            retour += tab[i];
        }
        return retour;

    }
    public static void bubbleSort(Integer tab[])    //ascending order
    {
        boolean sorted = false;
        while(!sorted)
        {
            for(int i = 1; i < tab.length; i++)
            {
                sorted = true;
                if(tab[i-1] > tab[i])
                {
                    int tmp = tab[i-1];
                    tab[i-1] = tab[i];
                    tab[i] = tmp;
                    sorted = false;
                }
            }
        }
    }
}