I've been observing people using the following method for summing up the left diagonal elements of a square array \(a\) of dimensions \(n\) by \(n\):
1 2 3 4 5 

Wouldn't the following account for a faster method?
1 2 

Problem Loading...
Note Loading...
Set Loading...
Comments
There are no comments in this discussion.