Question

in Java

Implement merging two sorted arrays into one sorted array. These arrays are sorted in descending order. For example [5, 4, 2]. Return an array with all the elements of these two arrays sorted, also in descending order.

partb: if the two arrays as input are size n each. What is the big-O run time and space complexity of your implementation

public int[] merge(int[] arr1, int[] arr2){

Answer 1

package sort;

public class Merge {

public int[] merge(int[] arr1, int[] arr2){

int t[]=new int[arr1.length+arr2.length];//make temp array of size with sum of two array

int k=0;

int k1=0; //from those two temp array copy elements in sorted array in original array

int l=0;

while(k<arr1.length && k1<arr2.length){

if(arr1[k]>=arr2[k1]){ //if arr1's element is less first copy it

t[l++]=arr1[k++];

}

else{

t[l++]=arr2[k1++]; //else arr2's

}

}

while(k<arr1.length){ //copy the remaining elements

t[l++]=arr1[k++];

}

while(k1<arr2.length){

t[l++]=arr2[k1++];

}

return t; //return array

}

//driver program to test

public static void main(String[] args) {

Merge m=new Merge();

int arr1[]={6,5,4,3,2,1};

int arr2[]={67,12,9,8,6};

int t[]=m.merge(arr1, arr2);

for(int i:t){

System.out.print(i+" ");

}

}

}

output

67 12 9 8 6 6 5 4 3 2 1