Question

In an ITEC 3150 section students have just taken a test. All the test scores are stored in an array. As the instructor you want to find what the highest score is on the test and how many students received that score. Write a method, topScore, that on an input array of integers representing students’ test scores, returns an integer array consisting of the highest score and the number of times it occurs.

The following is a sample run: Input: 54 78 62 65 74 90 90 75

Return value: 90 2

Explanation: 90 is the highest score and occurs twice in the input array.

Your method must have time complexity ?(?), where ? is the length of the input array. Therefore, you do not have time to sort because sorting requires ?(? log ?) time. Hint: You can go through the array a couple of times. Note: For this problem you are NOT allowed to use a HashMap or TreeMap. If you don’t know what these are, don’t worry.

Answer 1

Code:

public class Main
{
   public static void main(String args[])
   {
       int[] scores = new int[] { 54, 78, 62, 65, 74,90,90,75};
int[] out =new int[2];
  
       out[0]=scores[0];
       for(int i = 1; i < scores.length;i++)
       {
           if(scores[i] >out[0])
           {
               out[0] = scores[i];
           }
          
       }
      
   out[1]=0;
       for(int i = 0; i < scores.length;i++)
       {
           if(scores[i]==out[0])
           out[1]=out[1]+1;
           }
      
       System.out.println("The Highest score is:" + out[0]);
       System.out.println("No of students received the highest score is:" + out[1]);
   }
}

Output:

The Highest score is:90

No of students received the highest score is:2