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 Program to Generate All Subsets of a Given Set in the Lexico Graphic Order
Java Program to Implement Sorted Doubly Linked List
Java Program to Implement Hash Tables Chaining with Binary Trees
Display Auto-Configuration Report in Spring Boot
Logging a Reactive Sequence
Java Program to Implement Dijkstra’s Algorithm using Priority Queue
Jackson JSON Views
Jackson Annotation Examples
Java 8 Predicate Chain
Java Program to Implement Queue
How to Read a Large File Efficiently with Java
Java Program to Find the Longest Path in a DAG
Java Program to Check Multiplicability of Two Matrices
Xây dựng ứng dụng Client-Server với Socket trong Java
A Quick Guide to Spring Cloud Consul
Java Program to Describe the Representation of Graph using Incidence Matrix
Java Program to Find MST (Minimum Spanning Tree) using Kruskal’s Algorithm
The SpringJUnitConfig and SpringJUnitWebConfig Annotations in Spring 5
Guide To CompletableFuture
Create Java Applet to Simulate Any Sorting Technique
Returning Image/Media Data with Spring MVC
New Features in Java 13
Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree
Send email with authentication
Java Program to Implement Variable length array
Using Custom Banners in Spring Boot
Java Program to Implement Fisher-Yates Algorithm for Array Shuffling
A Guide to HashSet in Java
Spring Boot - Apache Kafka
Spring Boot - Actuator
Check if a String is a Palindrome in Java
Flattening Nested Collections in Java