This is a java program to find the median from two different array. To do so we merge the two lists and then sort them, after that we find the median of the sequence. If the total number of elements (N) is odd median is the N/2th element, if its even (N-1/2 + N/2)/2th element.
Here is the source code of the Java Program to Find Median of Elements where Elements are Stored in 2 Different Arrays. 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 median of 2 array
import java.util.Random;
public class Median_Two_Arrays
{
static int N = 10, M = 5;
static int[] sequence1 = new int[N];
static int[] sequence2 = new int[M];
static int[] sequence = new int[N+M];
public static void sort()
{
int i, j, temp;
for (i = 1; i < N+M; i++)
{
j = i;
temp = sequence[i];
while (j > 0 && temp < sequence[j - 1])
{
sequence[j] = sequence[j - 1];
j = j - 1;
}
sequence[j] = temp;
}
}
public static void main(String args[])
{
Random random = new Random();
for(int i=0; i<N; i++)
sequence1[i] = Math.abs(random.nextInt(100));
for(int i=0; i<M; i++)
sequence2[i] = Math.abs(random.nextInt(100));
for(int i=0; i<N; i++)
System.out.print(sequence1[i] + " ");
System.out.println();
for(int i=0; i<M; i++)
System.out.print(sequence2[i] + " ");
System.out.println();
int j=0;
for(int i=0; i<N+M; i++)
{
if(i >= N && j < M)
sequence[i] = sequence2[j++];
else
sequence[i] = sequence1[i];
}
sort();
if(N+M % 2 == 0)
System.out.println("The Median is : " + (sequence[(N+M)/2-1]+sequence[(N+M)/2])/2);
else
System.out.println("The Median is : " + sequence[(N+M)/2]);
}
}
Output:
$ javac Median_Two_Arrays.java $ java Median_Two_Arrays 92 53 68 15 17 23 95 47 46 61 63 62 48 66 26 The Median is : 53
Related posts:
Reactive WebSockets with Spring 5
Hashing a Password in Java
Introduction to the Java NIO2 File API
Java 8 Stream findFirst() vs. findAny()
Generic Constructors in Java
Converting between an Array and a List in Java
Java Program to Perform Insertion in a BST
Java Program to Implement Karatsuba Multiplication Algorithm
Java Program to Perform Search in a BST
Batch Processing with Spring Cloud Data Flow
@Order in Spring
Java Program to Find SSSP (Single Source Shortest Path) in DAG (Directed Acyclic Graphs)
Java Program to Perform Deletion in a BST
Java Program to Implement JobStateReasons API
More Jackson Annotations
The Registration API becomes RESTful
Java Program to Implement ArrayList API
MyBatis with Spring
Concrete Class in Java
Dockerizing a Spring Boot Application
Java Program to Implement AttributeList API
Queue và PriorityQueue trong Java
Java Program to Find All Pairs Shortest Path
Check If Two Lists are Equal in Java
Period and Duration in Java
Refactoring Design Pattern với tính năng mới trong Java 8
Spring Boot - Tomcat Deployment
Ép kiểu trong Java (Type casting)
Using a Custom Spring MVC’s Handler Interceptor to Manage Sessions
Java Program to Check whether Graph is a Bipartite using 2 Color Algorithm
Java Program to Compute Determinant of a Matrix
Java Program to Implement Binomial Heap