Đánh giá giải thuật

Danh gia thuat toan.

Bai 1:

For (i=1; i<=x; i++)

          For( j=1; j<=y; j++)

                   {

C [i] [j] = 0;

For( k=1; k<=z; k++)

          C [i] [j] +=A[i] [k] * B[k] [j];

}

--------à

T(n)=

Bai 2:

Int findmath( char *p,char *t)

{

          Int I,j;

          Int m,n;

          M=strlen(p);

          N=strlen(t);

          For (i=0; i<=(n-m) ; i++)

          {

                   J=0;

While ((i<m) && (t[i+j]==p[j]))

          J=j+1;

                             If (j==m) return (i);

          }

          Return(-1);

}

T(n)=