Help with Mode Ties in Java

[Bee Bus Hardware]

Hi, I have an assignment and part of it is I have to find the mode of an already sorted array that the user inputs. I have done the whole assignment already and I have gotten the mode to work with one issue. The issue is that it only records the first mode in the array and doesn't record any other if there is a a tie. Ill put my code below to show you what I have. If anyone can help get a code to record if there is a tie that would be awsome.

 

double maxValue = array[0];
        int maxCount = 0;
        for (int value : array) {
            int count = 0;
            for (j = 0; j < array.length; j++) {
                if (array[j] == value)
                    count++;
            }
            if (count > maxCount) {
                maxCount = count;
                maxValue = value;
            }
        }

        System.out.println("The mode is: " +maxValue);

 

[shadow_ray]

You can use sorted maps to count the occurrence of each different value and then get a sorted list of each key value pair.

https://docs.oracle.com/javase/8/docs/api/java/util/TreeMap.html

 

 

 

[Mokomoko]

To find the mode of an array, you can use a similar approach to the one you have implemented. One way to modify your code to handle ties is to use a Map to track the count of each value in the array. You can then iterate through the map to find the value with the highest count.

 

Here is an example of how you can do this:

import java.util.HashMap;
import java.util.Map;

//Implement your methods and use this body:

double[] array = {1, 2, 3, 3, 3, 4, 5};

Map<Double, Integer> counts = new HashMap<>();
for (double value : array) {
    if (counts.containsKey(value)) {
        counts.put(value, counts.get(value) + 1);
    } else {
        counts.put(value, 1);
    }
}

int maxCount = 0;
double maxValue = 0;
for (Map.Entry<Double, Integer> entry : counts.entrySet()) {
    if (entry.getValue() > maxCount) {
        maxCount = entry.getValue();
        maxValue = entry.getKey();
    }
}

System.out.println("The mode is: " + maxValue);

 

[Bee Bus Hardware]

On 12/16/2022 at 9:21 AM, Mokomoko said:

To find the mode of an array, you can use a similar approach to the one you have implemented. One way to modify your code to handle ties is to use a Map to track the count of each value in the array. You can then iterate through the map to find the value with the highest count.

 

Here is an example of how you can do this:

import java.util.HashMap;
import java.util.Map;

//Implement your methods and use this body:

double[] array = {1, 2, 3, 3, 3, 4, 5};

Map<Double, Integer> counts = new HashMap<>();
for (double value : array) {
    if (counts.containsKey(value)) {
        counts.put(value, counts.get(value) + 1);
    } else {
        counts.put(value, 1);
    }
}

int maxCount = 0;
double maxValue = 0;
for (Map.Entry<Double, Integer> entry : counts.entrySet()) {
    if (entry.getValue() > maxCount) {
        maxCount = entry.getValue();
        maxValue = entry.getKey();
    }
}

System.out.println("The mode is: " + maxValue);

 

Thanks, this worked