Question

****Coral Please****

Given a sorted list of integers, output the middle integer. Assume the number of integers is always odd.

Ex: If the input is 2 3 4 8 11 -1 (a negative indicates end), the output is:

4

The maximum number of inputs for any test case should not exceed 9. If exceeded, output "Too many inputs".

Hint: Use an array of size 9. First read the data into an array. Then, based on the number of items, find the middle item.

Answer 1

import java.util.Scanner;

public class Demo

{

    public static void main(String[] args){

    

        Scanner sc = new Scanner(System.in);

        int arr[];

        arr = new int[10];

        int count =0;

        int i;

        for (i = 0; i < arr.length; i++){

        

            arr[i] = sc.nextInt();

            count++;

            if(arr[i]<0){

            

                count =count -1;

                break;

}

}

            

        

        if(i>9){

        

            System.out.println("To Many inputs.");

}

       else if(count%2==0){

        

            System.out.println("No of Integers Must Be Odd");

}

       else{

          

                int mid = arr[count/2];

                System.out.println(mid);

}

    

}

}