Growth$-$Rate Functions $-$ Examples$4-5$

For nxn matrices, time complexity is:

Matrix Multiplication $($na$$ve$)$:

for$($int i $=0$; i $$ m$.$length; i$++)\{$

for$($int j $=0$; j $$ m$2.$length $-1$; j$++)\{$

for$($int k $=0$; k $$ m$2.$length; k$++)\{$

m$[$i$][$j$]+=$ m$[$i$][$k$]*$ m$2[$k$][$j$]$;

$\}$

$\}$

Hbw about this one?