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 Implement the Bin Packing Algorithm
Setting a Request Timeout for a Spring REST API
Implementing a Runnable vs Extending a Thread
The Basics of Java Security
Hướng dẫn Java Design Pattern – Visitor
Java Program to Implement Range Tree
How to Round a Number to N Decimal Places in Java
Initialize a HashMap in Java
Converting Between Byte Arrays and Hexadecimal Strings in Java
Giới thiệu thư viện Apache Commons Chain
Java – Rename or Move a File
Tính kế thừa (Inheritance) trong java
Java Program to Implement LinkedHashMap API
Java Program to Test Using DFS Whether a Directed Graph is Weakly Connected or Not
Java 8 Stream findFirst() vs. findAny()
Java Program to Implement Sieve Of Atkin
Guide to Java 8 groupingBy Collector
Từ khóa throw và throws trong Java
String Joiner trong Java 8
New Features in Java 8
LinkedList trong java
Java Program to Implement Binary Search Tree
@Lookup Annotation in Spring
Service Registration with Eureka
Java Program to Solve TSP Using Minimum Spanning Trees
Mệnh đề if-else trong java
Count Occurrences of a Char in a String
Mapping Nested Values with Jackson
Spring Boot - Twilio
A Guide to TreeSet in Java
Java Program to Implement ArrayList API
Giới thiệu Google Guice – Aspect Oriented Programming (AOP)