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 8 and Infinite Streams
Java Program to Implement Graph Structured Stack
Spring Security Logout
Adding Shutdown Hooks for JVM Applications
Java Program to Check Whether an Undirected Graph Contains a Eulerian Path
HTTP Authentification and CGI/Servlet
Java Program to Implement the RSA Algorithm
Java Program to Implement Merge Sort on n Numbers Without tail-recursion
Jackson – Decide What Fields Get Serialized/Deserialized
Mix plain text and HTML content in a mail
What is Thread-Safety and How to Achieve it?
Join and Split Arrays and Collections in Java
Spring Boot - Exception Handling
How to Return 404 with Spring WebFlux
Java Program to Implement an Algorithm to Find the Global min Cut in a Graph
Java Program to Implement Strassen Algorithm
CharSequence vs. String in Java
Toán tử trong java
Java Program to Implement Self organizing List
Java Program to Implement Ford–Fulkerson Algorithm
Spring Boot - Cloud Configuration Server
Java Program to Implement Bresenham Line Algorithm
Giới thiệu luồng vào ra (I/O) trong Java
Lớp TreeMap trong Java
Testing in Spring Boot
Java Program to Implement Lloyd’s Algorithm
Java Program to Generate All Possible Combinations Out of a, b, c, d, e
Java Program to Generate Random Numbers Using Probability Distribution Function
Guide to the Java TransferQueue
Java Program to Find Basis and Dimension of a Matrix
Inheritance and Composition (Is-a vs Has-a relationship) in Java
Servlet 3 Async Support with Spring MVC and Spring Security