Determine the big-O notation of the following algorithm: // A is an array with index from 0 to N-1 Algorithm C(A, x, a, b);            if (b

make an algorithm using the procedure to display the contents of a defined array, Array B[10] = (9, 11, 23, 7, 8, 20, 77, 22, 10, 6)

Write the algorithm which finds the second maximum value of the array. Then find the complexity of the algorithm as Big O notation

The algorithm below searches for the maximum in an input array A. Assume A is a random sequence containing n distinguishable real numbers, what is the probability for line #4 to be executed exactly once? (The phrase "random sequence" here means the n numbers can appear in any order with equal chance.) mymax(A, n) { 1: max = A[1]; 2: for i = 2:n 3: if A[i] > max 4: max = A[i); 5: end; 6: end; 7: return max; }