Java Program to Find the Mode in a Data Set

This is a java program to find the mode of a set. The mode of a set is defined as the highest occurring element in the set. We count the occurrence of each of the element and print the element whose count is highest.

Here is the source code of the Java Program to Find the Mode in a Data Set. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

//This is a java program to find the mode for a given sequence of numbers
import java.util.Random;
 
public class Mode 
{
    static int N = 20;
    static int[] sequence = new int[N];
 
    public static int mode() 
    {
        int maxValue = 0, maxCount = 0;
 
        for (int i = 0; i < sequence.length; ++i) 
        {
            int count = 0;
            for (int j = 0; j < sequence.length; ++j) 
            {
                if (sequence[j] == sequence[i])
                    ++count;
            }
            if (count > maxCount) 
            {
                maxCount = count;
                maxValue = sequence[i];
            }
        }
 
        return maxValue;
    }
 
    public static void main(String args[]) 
    {
        Random random = new Random();
 
        for (int i = 0; i < N; i++)
            sequence[i] = Math.abs(random.nextInt(100));
 
        System.out.println("The set of numbers are: ");
        for (int i = 0; i < N; i++)
            System.out.print(sequence[i] + " ");
 
        System.out.println("\nThe mode of the set is: " + mode());
    }
}

Output:

$ javac Mode.java
$ java Mode
 
The set of numbers are: 
85 3 80 56 37 47 13 11 94 38 6 12 10 31 52 67 81 98 43 37 
The mode of the set is: 37

Related posts:

How to Break from Java Stream forEach
Read an Outlook MSG file
Returning Image/Media Data with Spring MVC
Java Program to Perform Partition of an Integer in All Possible Ways
Java Program to Check whether Directed Graph is Connected using BFS
Java Program to Check if an UnDirected Graph is a Tree or Not Using DFS
Java Program to Implement Stein GCD Algorithm
Constructor Injection in Spring with Lombok
Java Program to Perform Encoding of a Message Using Matrix Multiplication
Rest Web service: Filter và Interceptor với Jersey 2.x (P1)
A Guide to JPA with Spring
Giới thiệu JDBC Connection Pool
Weak References in Java
Java Program to Implement an Algorithm to Find the Global min Cut in a Graph
Spring Boot - Scheduling
An Introduction to ThreadLocal in Java
How to Change the Default Port in Spring Boot
Java Program to Implement Sieve Of Sundaram
Java Program to Implement Knapsack Algorithm
Spring Cloud – Tracing Services with Zipkin
Spring Security OAuth2 – Simple Token Revocation
Lớp HashMap trong Java
Java Program to Implement Dijkstra’s Algorithm using Queue
Java Program to Implement Quick Hull Algorithm to Find Convex Hull
Configure a RestTemplate with RestTemplateBuilder
SOAP Web service: Authentication trong JAX-WS
Java Program to Compute Determinant of a Matrix
Feign – Tạo ứng dụng Java RESTful Client
Java Program to implement Array Deque
Tránh lỗi ConcurrentModificationException trong Java như thế nào?
Java Program to Find Minimum Element in an Array using Linear Search
Functional Interfaces in Java 8