Question

1. t(n) is the runtime of following function,

public static int f4(int [] a, int start, int end){

int ans = 0;

if (start >= end) ans = a[start]; else {

int mid = (start + end) / 2;

int x = f4(a, start, mid);

int y = f4(a, mid + 1, end);

print(a, start, end); //print each element in a from start to end if (x < y) ans = x;

else ans = y;

}

return ans;

}

public static void print(int [] a, int s, int e){

for (int i = s; i <= e; i++) System.out.println(i); }

Answer 1

we solve for time complexity of recurrence relations using the recurrence relations.
two recursive calls of size n/2 are made.
and work done in each recursive call is O(n) because of print function
so, recurrence relation is
T(n) = 2T(n/2) + O(n)