2. [10 points] Analyze the running time of the following two pieces of code. Give the...

Transcribed Image Text:

2. [10 points] Analyze the running time of the following two pieces of code. Give the best upper bounds for these. FA(A[1...n]) { // array of size n res = 0; i = 1; while (i < n) (1 if (A[i] < 0) return 0; for(j 0; j<n; j+-2); res += A[j]; i= i. 2; } return res; FB (A[1...n] { // array of size n res = 0; for (i = 0; i < n/2; i++) { res += A[i] * 2; } for (j-n; j > 0; j--) { res += FA (j); return res; 2. [10 points] Analyze the running time of the following two pieces of code. Give the best upper bounds for these. FA(A[1...n]) { // array of size n res = 0; i = 1; while (i < n) (1 if (A[i] < 0) return 0; for(j 0; j<n; j+-2); res += A[j]; i= i. 2; } return res; FB (A[1...n] { // array of size n res = 0; for (i = 0; i < n/2; i++) { res += A[i] * 2; } for (j-n; j > 0; j--) { res += FA (j); return res;

Answer rating: 100% (QA)

Lets analyze the running ... View the full answer