|
|
|
@ -12,6 +12,29 @@
@@ -12,6 +12,29 @@
|
|
|
|
|
|
|
|
|
|
int is_transpose(int M, int N, int A[N][M], int B[M][N]); |
|
|
|
|
|
|
|
|
|
void print_array(int M, int N, int A[N][M], int x, int y) |
|
|
|
|
{ |
|
|
|
|
int i,j; |
|
|
|
|
for (i = 0; i < N; i++) { |
|
|
|
|
for (j = 0; j < M; j++) { |
|
|
|
|
if(i == y && j == x) |
|
|
|
|
printf("\x1B[31m # \x1B[0m"); |
|
|
|
|
else |
|
|
|
|
printf(" # "); |
|
|
|
|
} |
|
|
|
|
printf("\n"); |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
void diff_array(int M, int N, int A[N][M], int B[M][N], int x, int y) |
|
|
|
|
{ |
|
|
|
|
printf("%d, %d\n", x, y); |
|
|
|
|
print_array(M, N, A, x, y); |
|
|
|
|
printf("\n"); |
|
|
|
|
print_array(N, M, B, y, x); |
|
|
|
|
getchar(); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* transpose_submit - This is the solution transpose function that you |
|
|
|
|
* will be graded on for Part B of the assignment. Do not change |
|
|
|
|