5. What is the (a) Best case (b) Worst case running time of this algorithm, justify your answer. ALGORITHM MaxElement(A[

[answerhappygod]

5 What Is The A Best Case B Worst Case Running Time Of This Algorithm Justify Your Answer Algorithm Maxelement A 1 (594.31 KiB) Viewed 34 times

5. What is the (a) Best case (b) Worst case running time of this algorithm, justify your answer. ALGORITHM MaxElement(A[0..n - 1]) //Determines the value of the largest element in a given array //Input: An array A[0..n - 1] of real numbers Erler //Output: The value of the largest element in A maxval A[0] for i 1 to n - 1 do if A> maxval 1108 maxval A return maxval
6. Solve the following recurrence relation. x(n) = x(n − 1) +5 for n > 1, x(1) = 0