Write a program to sort list of elements in ascending and descending order and show the exception handling.

import java.util.*;
class SortOrder
{
  public static void main(String[] args)
  {
    Scanner sc=new java.util.Scanner(System.in);
    System.out.print("Enter the array size: ");
    int size=sc.nextInt();
        int[] arr=new int[size];
        System.out.println("Enter Array elements: ");
        for(int i=0;i<size;i++)
        {
            System.out.print("Element No. "+(i+1)+": ");
            arr[i]=sc.nextInt();
        }
        System.out.print("Before Sorting: ");
        for(int i=0;i<size;i++)
        System.out.print(" "+arr[i]);
        for(int i=0;i<size;i++)
        {
            int temp;
            for(int j=i+1;j<size;j++)
            {
                if(arr[i]>arr[j])
                {
                        temp=arr[i];
                        arr[i]=arr[j];
                        arr[j]=temp;
                  }
            }
        }
        System.out.println();
        System.out.print("After Sorting in ascending order: ");
        for(int i=0;i<size;i++)
    {
            System.out.print(" "+arr[i]);
    }
    System.out.println();
        System.out.print("After Sorting in descending order: ");
    for(int i=size-1;i>=0;i--)
    {
            System.out.print(" "+arr[i]);
        }

  }
}

Output


C:\Users\Jaisha\Desktop\Java>javac SortOrder.java

C:\Users\Jaisha\Desktop\Java>java SortOrder
Enter the array size: 5
Enter Array elements:
Element No. 1: 5
Element No. 2: 3
Element No. 3: 62
Element No. 4: 1
Element No. 5: 52
Before Sorting:  5 3 62 1 52
After Sorting in ascending order:  1 3 5 52 62
After Sorting in descending order:  62 52 5 3 1