I had missed that, but I just made the change.


On Wed, Aug 21, 2013 at 8:24 PM, Ian Henriksen <notifications@github.com>wrote:

> In Algorithms/Matrices_Complexity/Matrices_Complexity.tex:
>
> >  given an input of size n.  Certain problems can be solved with fewer steps,
> > -whilst others require many more.  For example, given two matrices of size n,
> > -it only takes about n steps to add the entries together and thus matrix addition is $O(n)$.
> > -On the other hand, given a matrix of size $n$, it takes about
> > -$n^3$ steps to calculate its inverse,
> > +while others require many more.  For example, given two matrices of size n,
>
> ah, we say it is $O(n^2)$ further down. Yes, it needs to be $O(n^2)$.
>
> —
> Reply to this email directly or view it on GitHub<https://github.com/byuimpact/numerical_computing/pull/266/files#r5915313>
> .
>



-- 
Abe Frandsen