1.) What does the algorithm compute?

2.) What is the basic operation? (use one word)

3.) How many times is the basic operation executed in the worse case? C(n)=

4.) What is the worst case efficiency class? O(?)

Consider the following algorithm: Algorithm Enigma(A[0..n-1][0..n-1]) // Input: A matrix A[0n1][0..n1] of real numbers for i:=0 to n2 do for j:=i+1 to n1 do if A[i][j]=A[j][i] return false return true