Question: public class MyMergeAlgo { public int[] merge_sort(int[] array){ if(array.length

public class MyMergeAlgo { public int[] merge_sort(int[] array){ if(array.length<=1){ return array; } int midPoint=array.length/2; int[] left = new int[midPoint]; int[] right = new int[array.length-midPoint]; int result[]=new int[array.length]; for(int i=0;i

how to modify this code so it can work as descending order

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!