algorithm number 3 plz 16 return maxLe maxRight left sum rightsum ft 17 FI (A, l

Question

algorithm

number 3 plz

16 return maxLe maxRight left sum rightsum ft 17 FI (A, low, high) 18 if high low 19 return low high Allow] 20 else 21 mid floor (low-thigh) /2) 22 (leftLow, leftHigh,leftsum) Y (A,low ,mid) FINDMAXIMUMSUBARRA 23 (rightLow rightHigh Y (A, mid+1 ,high) highl 23 (crossLow, crossHigh crosssum) NDMAxcROSSINGSUBARRAY (A, low mad, 24 if ((leftsum rightsum) && (leftsum crosssum) return leftLow lefthigh. leftsum 26 el seif (rightsum 2 leftsum) &6 (rightsum 2 crosssum) return (right Low r right High right sum 28 else return cross Iow cross High Figure 1. Pseudo code for Maximum Subarray Algorithm (ref. CLRS pp 71-72)

Explanation / Answer

23 times

The function calls minmax recursively twice within the function itself and for n number of elements in the array , the comparison high == low will be done 2*n - 1 times.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.