Longest Common subsequence in Algorithm Design Analysis (C language)

# Include <stdio. h> # define N 7 # define M 7int max (int x, int y); void LCS (int l [n + 1] [M + 1], char * stra, char * strb); void disp (int A [n + 1] [M + 1]); int main () {char stra [] = "xzyzzyx "; char strb [] = "zxyyzxz"; int L [n + 1] [M + 1]; LCS (L, stra, strb); disp (l); Return 0 ;} int max (int x, int y) {return x> = y? X: Y;} void LCS (int l [n + 1] [M + 1], char * stra, char * strb) {int I, J; for (j = 0; j <= m; j ++) L [0] [J] = 0; for (I = 0; I <= N; I ++) L [I] [0] = 0; for (I = 1; I <= N; I ++) for (j = 1; j <= m; j ++) {If (stra [I-1] = strb [J-1]) {L [I] [J] = L [I-1] [J-1] + 1 ;} else {L [I] [J] = max (L [I-1] [J], L [I] [J-1]) ;}} void disp (int A [n + 1] [M + 1]) {int I, j; printf (""); For (j = 0; j <= m; j ++) printf ("% d", J); printf ("\ n"); for (I = 0; I <= N; I ++) {printf ("% d", I); For (j = 0; j <= m; j ++) {printf ("% d ", A [I] [J]);} printf ("\ n ");}}