For this question, mark all answers that apply.

Consider making changes to $C$ code to speed$-$up execution using a computer with a typical memory hierarchy? $($Hint: in C$,$ a$[0][0]$ is immediately followed by a$[0][1]$ in memory.$)$

Linear search has better performance than expected because all the memory references have great locality

You can speed up this:

for $($int $a[i][j]=0a[i][j]=0a[i][j]=0i=0$;$i$;$i=0$;$ij=0$;$j$; $++ji=0$;$ij=0$;$jj=0$;$j$ hat$(i)=0$;$i$