1.2. Finding the most frequently occurring value: 1.2.1. Develop a flowchart algorithm that: (30) Creates a...

 

Transcribed Image Text:

1.2. Finding the most frequently occurring value: 1.2.1. Develop a flowchart algorithm that: (30) Creates a single-dimension array of the size specified by the user, Initialize the array with random integers in the range of [0, 50], (2) (2) Display the "unsorted" array elements, (2) Sort out the array in ascending order (user the sort method from the standard Java library). (2) Print out the sorted sequence and, Find the most frequently occurring value in the array (if any). (2) (5) Your program should run continuously until the user opt to exit by entering an Exit sentinel such as 99. You are at discretion to select your own Exit key. 1.2.2. Implement your algorithm in 1.2.1 by writing a Java program. (5) (20) 1.2. Finding the most frequently occurring value: 1.2.1. Develop a flowchart algorithm that: (30) Creates a single-dimension array of the size specified by the user, Initialize the array with random integers in the range of [0, 50], (2) (2) Display the "unsorted" array elements, (2) Sort out the array in ascending order (user the sort method from the standard Java library). (2) Print out the sorted sequence and, Find the most frequently occurring value in the array (if any). (2) (5) Your program should run continuously until the user opt to exit by entering an Exit sentinel such as 99. You are at discretion to select your own Exit key. 1.2.2. Implement your algorithm in 1.2.1 by writing a Java program. (5) (20)