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:
Immutable Map Implementations in Java
Integer Constant Pool trong Java
How to Kill a Java Thread
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Spring Boot - Quick Start
Auditing with JPA, Hibernate, and Spring Data JPA
Spring MVC Setup with Kotlin
Check if a String is a Palindrome in Java
Java Program to Implement SynchronosQueue API
Hướng dẫn Java Design Pattern – Bridge
Java Program to Implement Threaded Binary Tree
Java Program to Describe the Representation of Graph using Incidence Matrix
Optional trong Java 8
Java Program to Print only Odd Numbered Levels of a Tree
JUnit5 @RunWith
Giới thiệu Json Web Token (JWT)
Guide to Dynamic Tests in Junit 5
List Interface trong Java
Java program to Implement Tree Set
Quick Guide to Spring MVC with Velocity
Send an email using the SMTP protocol
Java Program to Implement the String Search Algorithm for Short Text Sizes
Spring Data MongoDB – Indexes, Annotations and Converters
Java Program to Construct an Expression Tree for an Postfix Expression
Predicate trong Java 8
Guide to Spring Cloud Kubernetes
Spring Boot - Code Structure
Convert Character Array to String in Java
Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree
Refactoring Design Pattern với tính năng mới trong Java 8
HttpClient 4 – Follow Redirects for POST
Intro to Spring Boot Starters