Question

In java language: Ask for keyboard input of a decimal number. Use a loop to keep asking for input of up to ten numbers. Exit the loop if ten numbers are entered or if a sentinel value for “QUIT” is entered. Store the numbers in an array. Sort the array according to ascending number. Get the average for all the numbers in the array. Print out the average. Calculate the distance from the average for each number in the array and print out the difference. Use a binary search method to search for a number in the array and display to the console

Answer 1

import java.util.Scanner;

class Main{



    public static void main(String[] args) {
        Scanner obj = new Scanner(System.in);
        int arr[] = new int[10];
        int size = 0;
        System.out.println("Enter numbers");
        while(size<10){
//            System.out.println("Enter a number");
            String no = obj.nextLine();
            if(no.equals("QUIT")){
                break;
            }
            arr[size++] = Integer.parseInt(no);

        }


        for(int i=0;i<size;i++){
            for(int j=i+1;j<size;j++){
                if(arr[i]>arr[j]){
                    int t = arr[i];
                    arr[i] = arr[j];
                    arr[j] = t;
                }
            }
        }

        System.out.println("After sorting");
        for(int i=0;i<size;i++){
            System.out.print(arr[i]+" ");
        }
        System.out.println();

        double sum = 0;
        for(int i=0;i<size;i++){
            sum += arr[i];
        }
        double avg = sum/size;
        System.out.println("Average is "+avg);

        System.out.println("Difference to average is : ");
        for(int i=0;i<size;i++){
            System.out.println(arr[i]+" "+Math.abs(arr[i]-avg));
        }

        //Perform binary search
        System.out.println("Enter the element");
        int el = obj.nextInt();
        int start =0;
        int end = size;
        int mid = (start+end)/2;
        //Dp until start<end
        while(start<=end){
            if(arr[mid]==el){
                System.out.println("Found");
                break;
            }
            if(arr[mid]>el){
                end = mid-1;
            }
            else{
                start = mid+1;
            }
            mid = (start+end)/2;
        }

    }
}

OUTPUT :