How can we improve this algorithm?

ALGORITHM MatrixMultiplication $(A[0..n-1,0..n-1],B[0..n-1,0..n-1])$

$//$Multiplies two square matrices of order $n$ by the definition$-$based algorithm

$//$Input: Two $nn$ matrices A and $B$

$//$Output: Matrix $C=AB$

for ilarr$0$ to $n-1$ do

for jlarr$0$ to $n-1$ do

$C[i,j]larr0\mathrm{.}0$

for klarr$0$ to $n-1$ do

$C[i,j]larrC[i,j]+A[i,k]**B[k,j]$

return $C$