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 - Enabling Swagger2
Guide to PriorityBlockingQueue in Java
Java Program to Implement Hash Tables chaining with Singly Linked Lists
Spring Boot - Enabling HTTPS
Java Program to Check Whether an Undirected Graph Contains a Eulerian Path
ThreadPoolTaskExecutor corePoolSize vs. maxPoolSize
Apache Commons Collections SetUtils
Removing Elements from Java Collections
Java Program to do a Breadth First Search/Traversal on a graph non-recursively
Java Program to Perform Quick Sort on Large Number of Elements
Java Program to Implement Uniform-Cost Search
Java Program to Perform Search in a BST
Java Program to Use the Bellman-Ford Algorithm to Find the Shortest Path
Reading an HTTP Response Body as a String in Java
Java Program to Implement Attribute API
Java Program to Implement Park-Miller Random Number Generation Algorithm
Java Program to Implement Hamiltonian Cycle Algorithm
Java Program to Compute Cross Product of Two Vectors
Giới thiệu Aspect Oriented Programming (AOP)
Logout in an OAuth Secured Application
Getting the Size of an Iterable in Java
Check if there is mail waiting
Java Program to Evaluate an Expression using Stacks
Introduction to Spring Data JPA
SOAP Web service: Authentication trong JAX-WS
How to Read a File in Java
Guide to the Synchronized Keyword in Java
Java Program to Implement wheel Sieve to Generate Prime Numbers Between Given Range
Apache Commons Collections Bag
Spring Boot - Database Handling
Convert a Map to an Array, List or Set in Java
Hướng dẫn tạo và sử dụng ThreadPool trong Java