This is a Java Program to find median of two sorted arrays using binary search approach. In probability theory and statistics, a median is described as the number separating the higher half of a sample, a population, or a probability distribution, from the lower half. The median of a finite list of numbers can be found by arranging all the numbers from lowest value to highest value and picking the middle one. However size of both arrays must be equal. The time complexity of the following program is O (log n).
Here is the source code of the Java program to find median of two sorted arrays. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/* * Java Program to Find the Median of two Sorted arrays using * Binary Search Approach */ import java.util.Scanner; public class MedianOfTwoSortedArrays { public static void main(String[] args) { Scanner scan = new Scanner(System.in); System.out.println("Enter number of elements in arrays"); int N = scan.nextInt(); int[] arr1 = new int[ N ]; int[] arr2 = new int[ N ]; System.out.println("Enter "+ N +" elements of array 1"); for (int i = 0; i < N; i++) arr1[i] = scan.nextInt(); System.out.println("Enter "+ N +" elements of array 2"); for (int i = 0; i < N; i++) arr2[i] = scan.nextInt(); int med = median(arr1, arr2); System.out.println("Median = "+ med); } public static int median(int[] arr1, int[] arr2) { int N = arr1.length; return median(arr1, 0, N -1 , arr2, 0, N - 1); } public static int median(int[] arr1, int l1, int h1, int[] arr2, int l2, int h2) { int mid1 = (h1 + l1 ) / 2; int mid2 = (h2 + l2 ) / 2; if (h1 - l1 == 1) return (Math.max(arr1[l1] , arr2[l2]) + Math.min(arr1[h1] , arr2[h2]))/2; else if (arr1[mid1] > arr2[mid2]) return median(arr1, l1, mid1 , arr2, mid2 , h2); else return median(arr1, mid1 , h1, arr2, l2 , mid2 ); } }
Enter number of elements in arrays 5 Enter 5 elements of array 1 1 12 15 26 38 Enter 5 elements of array 2 2 13 17 30 45 Median = 16
Related posts:
Java Program to Perform Uniform Binary Search
Check If a File or Directory Exists in Java
Quick Guide to Spring MVC with Velocity
Java Program to Implement Weight Balanced Tree
Debug a JavaMail Program
Refactoring Design Pattern với tính năng mới trong Java 8
Spring @Primary Annotation
Java Program to Implement Pagoda
Sending Emails with Java
Call Methods at Runtime Using Java Reflection
Java Concurrency Interview Questions and Answers
OAuth 2.0 Resource Server With Spring Security 5
Hướng dẫn Java Design Pattern – Service Locator
Java Program to Implement Gale Shapley Algorithm
Java Program to Use Boruvka’s Algorithm to Find the Minimum Spanning Tree
@Before vs @BeforeClass vs @BeforeEach vs @BeforeAll
Introduction to Spring Boot CLI
Java Program to Find the Mode in a Data Set
Convert Character Array to String in Java
Debug a HttpURLConnection problem
Mix plain text and HTML content in a mail
Java Program to Implement Sorted Circularly Singly Linked List
DynamoDB in a Spring Boot Application Using Spring Data
Guide to java.util.Formatter
Wrapper Classes in Java
Toán tử instanceof trong java
Setting a Request Timeout for a Spring REST API
Java Program to Perform Complex Number Multiplication
Java Program to Implement Circular Doubly Linked List
Java Program to Implement Queue using Two Stacks
LinkedHashSet trong java
The Difference Between map() and flatMap()