Here is one algorithm:

procedure Secret(A[0..n 1])

// Input: An array A[0..n 1] of integers

minval A[0];

maxval A[0]

for i 1 to n 1 do

if A[i] < minval minval A[i]

if A[i] > maxval maxval A[i]

return maxval minval

Here is another algorithm:

procedure Enigma(A[0..n 1, 0..n 1])

// Input: An array A[0..n 1, 0..n 1] of real numbers

for i 0 to n 2 do

for j i + 1 to n 1 do

if A[i, j] != A[j, i]

return false

return true

What is the running time (T(n)) for each algorithm?