How to get the median of two sorted arrays in Java

3 Answers

0 votes
public class MyClass {
     private static double findMedianOfTwoSortedArrays(int[] arr1, int[] arr2) {
        int size1 = arr1.length;
        int size2 = arr2.length;
        Integer [] merged = new Integer[size1 + size2]; 
        int i = 0, j = 0, k = 0;

        while (i < size1 && j < size2) {
            if (arr1[i] < arr2[j]) {
                merged[k++] = arr1[i++];
            }
            else {
                merged[k++] = arr2[j++];
            }
        }
     
        while (i < size1) {
            merged[k++] = arr1[i++];
        }
     
        while (j < size2) {
            merged[k++] = arr2[j++];
        }
     
        int total = size1 + size2;
        double median;
        if (total % 2 == 0) {
            int mid1 = merged[(total - 1) / 2];
            int mid2 = merged[total / 2];
            median = (double)(mid1 + mid2) / 2.0;
        }
        else {
            median = (double)merged[total / 2];
        }
     
        return median;
    }
    public static void main(String args[]) {
        int[] arr1 = {1, 3, 5};

        int[] arr2 = {2, 4, 6};
     
        double median = findMedianOfTwoSortedArrays(arr1, arr2);
     
        System.out.print("Median: " + median);
    }
}
 
 
 
 
/*
run:
 
Median: 3.5
 
*/

 



answered Jul 19, 2023 by avibootz
edited Jul 19, 2023 by avibootz
0 votes
public class MyClass {
     private static double findMedianOfTwoSortedArrays(int[] arr1, int[] arr2) {
        int size1 = arr1.length;
        int size2 = arr2.length;
        int i = 0, j = 0;
        int mid1 = -1, mid2 = -1;
          
        if ((size2 + size1) % 2 == 1) {
            for (int k = 0; k <= (size1 + size2) / 2; k++) {
                if (i != size1 && j != size2) {
                    mid1 = (arr1[i] > arr2[j]) ? arr2[j++] : arr1[i++];
                }
                else if (i < size1) {
                    mid1 = arr1[i++];
                }
                else {
                    mid1 = arr2[j++];
                }
            }
            return mid1;
        }
        else {
            for (int k = 0; k <= (size1 + size2) / 2; k++) {
                mid2 = mid1;
                if (i != size1 && j != size2) {
                    mid1 = (arr1[i] > arr2[j]) ? arr2[j++] : arr1[i++];
                }
                else if (i < size1) {
                    mid1 = arr1[i++];
                }
                else {
                    mid1 = arr2[j++];
                }
            }
            return (double)(mid1 + mid2) / 2;
        }
    }
    public static void main(String args[]) {
        int[] arr1 = {1, 3, 5};

        int[] arr2 = {2, 4, 6};
     
        double median = findMedianOfTwoSortedArrays(arr1, arr2);
     
        System.out.print("Median: " + median);
    }
}
 
 
 
 
/*
run:
 
Median: 3.5
 
*/

 



answered Jul 19, 2023 by avibootz
edited Jul 19, 2023 by avibootz
0 votes
import java.util.Arrays;

public class MyClass {
     private static double findMedianOfTwoSortedArrays(int[] arr1, int[] arr2) {
        int size1 = arr1.length;
        int size2 = arr2.length;

        int[] merged = new int[arr1.length + arr2.length];
        
        for (int i = 0; i < size1; i++) {
            merged[i] = arr1[i];
        }
 
        for (int i = 0; i < size2; i++) {
            merged[i + arr1.length] = arr2[i];
        }
        
        Arrays.parallelSort(merged);

        int total = size1 + size2;
        double median;
        if (total % 2 == 0) {
            int mid1 = merged[(total - 1) / 2];
            int mid2 = merged[total / 2];
            median = (double)(mid1 + mid2) / 2.0;
        }
        else {
            median = (double)merged[total / 2];
        }
      
        return median;
    }
    public static void main(String args[]) {
        int[] arr1 = {1, 3, 5};
 
        int[] arr2 = {2, 4, 6};
      
        double median = findMedianOfTwoSortedArrays(arr1, arr2);
      
        System.out.print("Median: " + median);
    }
}
  
  
  
  
/*
run:
  
Median: 3.5
  
*/

 



answered Jul 19, 2023 by avibootz
...