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:
Spring Boot - Logging
Returning Image/Media Data with Spring MVC
Removing all duplicates from a List in Java
Spring Security with Maven
Java Program to Implement Self Balancing Binary Search Tree
Using Optional with Jackson
The DAO with JPA and Spring
Java 8 and Infinite Streams
Java – Delete a File
Giới thiệu Java 8
Spring Cloud AWS – RDS
Java Program to Sort an Array of 10 Elements Using Heap Sort Algorithm
Java Program to Describe the Representation of Graph using Incidence Matrix
Java Program to Perform LU Decomposition of any Matrix
Initialize a HashMap in Java
Java Program to implement Bit Matrix
Concurrent Test Execution in Spring 5
Tips for dealing with HTTP-related problems
Java Program to Show the Duality Transformation of Line and Point
Java Program to Implement EnumMap API
An Intro to Spring Cloud Contract
Servlet 3 Async Support with Spring MVC and Spring Security
HashSet trong Java hoạt động như thế nào?
Custom HTTP Header with the HttpClient
Spring Boot - Quick Start
Java Program to Find the Nearest Neighbor Using K-D Tree Search
Java – Rename or Move a File
Java Program to Implement LinkedHashMap API
Java Program to Implement Stack using Two Queues
Array to String Conversions
Vector trong Java
Java Program to Check if an UnDirected Graph is a Tree or Not Using DFS