Analysis of algorithms | Computer Science homework help
CS 5200 Homework -1 (Deadline: 09-17-2023 11:59pm) Instructor: Huiyuan Yang Q1. Complexity analysis [11%] 1) Consider the following algorithm (assume n >1) 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++) if (A[i][j] == A[k][m] && !(i==k && j==m)) return 1; return 0; } […]