int any equal (int n, int A[][])
index i, j, k,m;
for (i = 1; i <= n; i++)
for (j= 1; j <= n; j++)
for (k = 1; k<= n; k++)
for (m= 1; m <= n; m++)
}
return 0;
if (A[i][j] ==A[k] [m] && !(i==k &&j==m))
return 1;
(a) What is the best case time complexity of the algorithm (assuming
n> 1)?
(b) What is the worst case time complexity of the algorithm?
(c) Try to improve the efficiency of the algorithm.
(d) What property holds for the array A if the algorithm returns 0?
(e) What property holds for the array A if the algorithm returns 1?
