java program, the user provides as input an odd integer n. An integer array A[0 .. n−1] of size n is then allocated dynamically and initialised with A[i] = 0 for every index i. The program then reads integer inputs provided by the user. As long as these inputs are between 0 and n−1 (including the two numbers), the program continues to accept more integers in a loop. Every time an input i is provided, the program does A[i]++. The number of integers between 0 and n−1 that have been input by the user, is counted in an integer variable m. Once the program comes out of the loop, the program has to find the statistical mode of the numbers 0 to n−1 . (Mode is the number between 0 and n−1 that has occurred as an input the maximum number of times.) What additional steps will the program have to go through? which statement is true by following option, it can be more than one true answers. A.Sort the array A[0..n − 1] in ascending order and report A[n − 1] as the mode. B.The index i such that A[i] is at most n/2.
In a java
which statement is true by following option, it can be more than one true answers.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps