Question

Write a recursive function that computes the smallest integer in a given array of integers. Use the following algorithm:

int min(int[] A, int low, int high) {

if (low == high) return A[low];

int mid = (low + high) / 2;

int min1 = min(A, low, mid);

int min2 = min(A, mid + 1, high);

if (min1 > min2) return min2;

return min1; }

Answer 1

public class FindMinimum {

public static int min(int[] A, int low, int high) {

if (low == high) return A[low];

int mid = (low + high) / 2;

int min1 = min(A, low, mid);

int min2 = min(A, mid + 1, high);

if (min1 > min2) return min2;

return min1;

}

public static void main(String[] args) {

int arr[] = {3,4,1,10,6,4,5,6,7,8,9,100,2};

System.out.println(min(arr,0,arr.length - 1));

}

}

===================================
SEE OUTPUT

86 public static int min(int A, int low, int high) { 87 88 if (low high) return A[low]; 89 90 int mid (lowhigh) / 2; 91 92 int min1 = minCA, low, mid); 93 94 int min2 = minCA, mid 1, high); 95 96 if (min1 min2) return min2; 97 98 return min1; 99 100 101 102 103 104 public static void main(String] args) { 105 int arr System.out.printlnCminarr,0,arr.length 1); 3,4,1,10,6,4,5,6,7,8,9,100,2}; 106 107 Console ShoppingCartPrinter (1) [Java Application] /Library/Java/JavaVirtualMachines/jdk1.8.0 231.j 1

PLEASE COMMENT if there is any concern.

==============================