QUESTION 3 Based on the following pseudocode: greatest(int A[], int n) { greatestValue =A[O]; for(i=1;i
Posted: Fri May 20, 2022 1:44 pm
QUESTION 3 Based on the following pseudocode: greatest(int A[], int n) { greatestValue =A[O]; for(i=1;i<n; i++){ if(A[]> greatestValue) { greatestValue =A;} } Retum greatest;} Write a function that represents the execution cost for the worst scenario. Asumme the following cost for each instruction type: Assignment C1 For loop C2 If then C3 Return clause C4