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:
Java – String to Reader
How to Store Duplicate Keys in a Map in Java?
OAuth 2.0 Resource Server With Spring Security 5
The Modulo Operator in Java
Adding Shutdown Hooks for JVM Applications
Apache Tiles Integration with Spring MVC
Default Password Encoder in Spring Security 5
Spring Boot - Unit Test Cases
Java Program to Implement Euclid GCD Algorithm
Java Program to Check if an UnDirected Graph is a Tree or Not Using DFS
Java Program to Implement Levenshtein Distance Computing Algorithm
Custom JUnit 4 Test Runners
Java Program to Implement Selection Sort
Java Program to implement Circular Buffer
Java Program to Implement AVL Tree
Java Program to Check Whether an Undirected Graph Contains a Eulerian Cycle
A Guide To UDP In Java
Java Program to implement Dynamic Array
Debug a JavaMail Program
Java Program to Find the Mode in a Data Set
Java Program to Generate a Random Subset by Coin Flipping
Spring Security Custom AuthenticationFailureHandler
JPA/Hibernate Persistence Context
Hướng dẫn Java Design Pattern – Adapter
Java Program to Implement Randomized Binary Search Tree
Java Program to Find Second Smallest of n Elements with Given Complexity Constraint
Java – Combine Multiple Collections
Receive email using IMAP
SOAP Web service: Authentication trong JAX-WS
Java – Reader to Byte Array
Spring’s RequestBody and ResponseBody Annotations
Java Program to Implement Horner Algorithm