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:
Jackson Date
XML-Based Injection in Spring
How to Store Duplicate Keys in a Map in Java?
Functional Interface trong Java 8
Registration with Spring Security – Password Encoding
Spring 5 Functional Bean Registration
Spring MVC Custom Validation
The Order of Tests in JUnit
Java Program to Implement Park-Miller Random Number Generation Algorithm
Filtering and Transforming Collections in Guava
Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree
Spring Boot - Rest Template
The Basics of Java Security
XML Serialization and Deserialization with Jackson
What is Thread-Safety and How to Achieve it?
Java Program to Implement Max Heap
Hướng dẫn Java Design Pattern – Abstract Factory
A Comparison Between Spring and Spring Boot
Hướng dẫn Java Design Pattern – State
Spring Security Authentication Provider
Java Program to Find SSSP (Single Source Shortest Path) in DAG (Directed Acyclic Graphs)
Java Program to Implement Tarjan Algorithm
Multi Dimensional ArrayList in Java
Array to String Conversions
Removing Elements from Java Collections
Java Program to Implement Levenshtein Distance Computing Algorithm
How to Kill a Java Thread
Spring Boot - Cloud Configuration Server
Java Program to Implement Patricia Trie
Serialize Only Fields that meet a Custom Criteria with Jackson
Java Program to Implement Sorted Circular Doubly Linked List
Java Program to Implement Hamiltonian Cycle Algorithm