A class InsSort contains an array of integers which sorts the elements in a particular order. Some…

import java.util.Scanner;

class InsSort
{
    int arr[];
    int size;

    InsSort(int s)
    {
        size = s;
        arr = new int[size];
    }

    void getArray()
    {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < size; i++)
        {
            System.out.print("Enter element " + (i + 1) + ": ");
            arr[i] = sc.nextInt();
        }
    }

    void insertionSort()
    {
        for (int i = 1; i < size; i++)
        {
            int key = arr[i];
            int j = i - 1;
            while (j >= 0 && arr[j] < key)
            {
                arr[j + 1] = arr[j];
                j--;
            }
            arr[j + 1] = key;
        }
    }

    double find()
    {
        int sum = 0, count = 0;
        for (int i = 0; i < size; i++)
        {
            if (arr[i] % 2 != 0)
            {
                sum += arr[i];
                count++;
            }
        }
        if (count == 0)
            return 0;
        return (double) sum / count;
    }

    void display()
    {
        System.out.print("Sorted array (descending order): ");
        for (int i = 0; i < size; i++)
            System.out.print(arr[i] + " ");
        System.out.println();
        System.out.println("Average of odd numbers = " + find());
    }

    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter size of array: ");
        int s = sc.nextInt();
        InsSort obj = new InsSort(s);
        obj.getArray();
        obj.insertionSort();
        obj.display();
    }
}