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:
Tính trừu tượng (Abstraction) trong Java
Java Program to Implement LinkedHashMap API
New Features in Java 12
Lập trình đa luồng với CompletableFuture trong Java 8
Functional Interfaces in Java 8
Display Auto-Configuration Report in Spring Boot
Java Program to Perform integer Partition for a Specific Case
Java Program to Implement Pollard Rho Algorithm
Creating Docker Images with Spring Boot
Getting Started with Custom Deserialization in Jackson
Java Program to Create a Random Graph Using Random Edge Generation
Java Program to Implement TreeSet API
A Guide to Iterator in Java
The Basics of Java Security
Database Migrations with Flyway
The Difference Between Collection.stream().forEach() and Collection.forEach()
Java Program to Permute All Letters of an Input String
Lớp Collectors trong Java 8
Zipping Collections in Java
Java Program to Implement Triply Linked List
Spring MVC and the @ModelAttribute Annotation
Exception Handling in Java
The XOR Operator in Java
More Jackson Annotations
Returning Image/Media Data with Spring MVC
OAuth2.0 and Dynamic Client Registration
Spring Cloud – Tracing Services with Zipkin
Java Program to Implement Sorted Array
Inject Parameters into JUnit Jupiter Unit Tests
Java Program to Find the Longest Subsequence Common to All Sequences in a Set of Sequences
Java Program to Check whether Graph is a Bipartite using BFS
Java Program to Implement Treap