Input:

A=[1 -2 2 3;1 -1 0 2;3 -3 1 4;2 1 2 -1]
_____________________________
%Crout Algorithm _WMK_MA355IS
%Initialization
if A(1,1)==0
end
n=length(A);
L=zeros(n,n);
U=zeros(n,n);
%Dot products of vectors Lprime, Uprime
%defined as matrices
Dot1=zeros(n,n);
Dot2=zeros(n,n);
%Step 2 of psuedocoded program
for j1=1:n
    L(j1,1)=A(j1,1);
    U(1,j1)=A(1,j1)/L(1,1);
end
N=2;
%Main routine (steps 3 through 5)
for p=N:n
   for j2=p:n
        for k2=1:p-1
             LL(j2,k2)=L(j2,k2);
             UU(j2,k2)=U(k2,j2);
        end
% Formula in Step 3 (computing and updating L)   
      m2=size(LL);
         for l2=1:m2(1,2)
              Dot1(j2,p)=Dot1(j2,p)+LL(j2,l2)*UU(p,l2)';
         end
           for l3=1:m2(1,2)
              Dot2(p,j2)=Dot2(p,j2)+LL(p,l3)*UU(j2,l3)';
           end
       L(j2,p)=A(j2,p)-Dot1(j2,p);
%Formula in Step 4 (computing and updating U)
   U(p,p)=1;
        for j3=p+1:n
         U(p,j3)=(A(p,j3)-Dot2(p,j3))/L(p,p);
       end
   end
end
'L= ',L,'U= ',U