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: Customize the Jackson ObjectMapper
4 tính chất của lập trình hướng đối tượng trong Java
Registration – Activate a New Account by Email
Consumer trong Java 8
Quick Guide on Loading Initial Data with Spring Boot
Java Program to Implement Threaded Binary Tree
Java Program to Implement Flood Fill Algorithm
Spring Boot - Hystrix
What is Thread-Safety and How to Achieve it?
Java Program to Solve the 0-1 Knapsack Problem
Java Program to Implement Slicker Algorithm that avoids Triangulation to Find Area of a Polygon
Lớp Collectors trong Java 8
Java Program to Check whether Graph is Biconnected
Java Program to implement Sparse Vector
Từ khóa this và super trong Java
Java String Conversions
Java Program to Represent Graph Using Incidence List
So sánh ArrayList và Vector trong Java
Java Program to Implement Dijkstra’s Algorithm using Set
Java Program to Implement Treap
Java Program to Implement Unrolled Linked List
Java Program to Find Hamiltonian Cycle in an UnWeighted Graph
Get and Post Lists of Objects with RestTemplate
Spring Security and OpenID Connect
Java Program to Check if a Given Binary Tree is an AVL Tree or Not
Reading an HTTP Response Body as a String in Java
Spring Boot - Tracing Micro Service Logs
Guide to the ConcurrentSkipListMap
Send email with authentication
OAuth2 Remember Me with Refresh Token
Java Program to Implement Shunting Yard Algorithm
Java Program to Implement Hash Tables