Question

1. Write a static method named mode that takes an array of integers as a parameter and that returns the value that occurs most frequently in the array. Assume that the integers in the array appear in sorted order. For example, if a variable called list stores the following values: ist -3, 1, 4, 4, 4, 6, 7,8, 8, 8, 8, 9, 11, 11, 11, 12, 14, int 141i Then the call of mode (li array, appearing four times. st, should retum 8 because 8 is the most frequently occurring value in the İftwo or more values tie for the most occurrences, return the one with the lowest v if the arra there are also three 9s alue. For example, y stores the following values, the call of mode (list) should return 2 despite the fact that int() list (1, 2, 2, 2, 5, 7, 9, 9, 9): e should be the array's elements are unique, every value occurs exactly once, so the first element valu returned. You may assume that the array's length is at least 1. If the array contains only one element, that element's value is considered the mode.

Answer 1

/* IDEA: ASSIGN MOST FREQUENT TO BE FIRST ELEMENT THEN LOOP FROM INDEX 1 TO N AND CHECK IF PREVIOUS ELEMENT IS EQUAL TO CURRENT ELEMENT INCREASE COUNT IF SINGLE ELEMENT THE RETURN FIRST OTHERWISE CHECK MAXCOUNT VALUE AND RETURN IT */

static int mostFrequent(int list[], int n)
{
   // find the max frequency using linear
   int maxcount = 1, res = list[0];
   int currcount = 1;
  
   for (int i = 1; i < n; i++)
   {
       if (list[i] == list[i - 1])
           currcount++;
       else
       {
           if (currcount > maxcount)
           {
               maxcount = currcount;
               res = list[i - 1];
           }
           currcount = 1;
       }
   }
  
   // If last element is most frequent
   if (currcount > maxcount)
   {
       maxcount = currcount;
       res = list[n - 1];
   }
  
   return res;
}

/* PLEASE UPVOTE(THANK YOU IN ADVANCE) IF YOU SATISFY WITH THE ANSWER IF ANY QUERY ASK ME IN COMMENT SECTION . I WILL RE-SOLVE THE QUESTION FOR YOU */