Created
July 30, 2017 21:57
-
-
Save thmain/7e42c45584c2772054b0b0639b6dd419 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class MaxDifferenceDandC { | |
public int maxDifference(int [] A, int start, int end){ | |
if(start>=end){ | |
return -1; | |
} | |
int mid = start + (end-start)/2; | |
int leftDiff = maxDifference(A,start,mid); | |
int rightDiff = maxDifference(A,mid+1,end); | |
int minLeft = getMin(A, start, mid); | |
int maxRight = getMax(A, mid, end); | |
int centerDiff = maxRight - minLeft; | |
return Math.max(centerDiff, Math.max(leftDiff,rightDiff)); | |
} | |
public int getMin(int [] A, int i, int j){ | |
int min = A[i]; | |
for (int k = i+1; k <=j ; k++) { | |
if(A[k]<min) | |
min = A[k]; | |
} | |
return min; | |
} | |
public int getMax(int [] A, int i, int j){ | |
int max = A[i]; | |
for (int k = i+1; k <=j ; k++) { | |
if(A[k]>max) | |
max = A[k]; | |
} | |
return max; | |
} | |
public static void main(String[] args) { | |
MaxDifferenceDandC m = new MaxDifferenceDandC(); | |
int [] A = { 2, 5, 1, 7, 3, 4, 9, 4, 5}; | |
int start = 0; | |
int end = A.length-1; | |
System.out.println("Maximum Difference between two elements A[i] and A[j] and where j > i: " + | |
m.maxDifference(A, start, end)); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment