Sorting in JAVA

import java.util.Scanner;
class Numbersorting
{
    public static void main(String args[])
    {
        Scanner in = new Scanner(System.in);
        int number[] = new int[100];
        int n, i, j;
        try
        {
            System.out.println("Enter the limit");
            n = in .nextInt();
            System.out.println("Enter 5 numbers");
            for (i = 0; i < n; i++) number[i] = in .nextInt();
            for (i = 0; i < n; i++)
            {
                System.out.println(" " + number[i]);
            }
            System.out.print("\n");
            for (i = 0; i < n; i++)
            {
                for (j = i + 1; j < n; j++)
                {
                    if (number[i] < number[j])
                    {
                        int temp = number[i];
                        number[i] = number[j];
                        number[j] = temp;
                    }
                }
            }
            System.out.print("Sorted list");
            for (i = 0; i < n; i++)
            {
                System.out.println(" " + number[i]);
            }
            System.out.println(" ");
        }
        catch (Exception e)
        {}
    }
}