Скачать или смотреть matrices recursion c++

2 corrections july 11 2014 , annotation editor not working , corrections are below ..
complete 3 by 3 matrix paper analysis of 3 system of equations. .
c++ implementation of the 3 by 3 matrix analysis .
2 recursion problems implemented with for() Loops .
with liner notes.

correction 1:
frame_1 two 1 by 3 are 1D arrays .

correction 2: Fib recursion implementation :
in the for() Loop body just after present = next ; add this:

if( past "Less Then" present ) "Less Then" left facing arrow head
; // ok , so do it again can't be typed here . when past
else is less then present , we have
{ NOT rolled over .
count "max count is :" ( count + 2 ) endl ;
break ;
}

with nth of 1,000,000 the 64 bit unsigned int will "roll over"
many many times. For the start using 12 18 , a Max Fib
count is 88 , the number is just less then 2^64 . To extend the
range , use float or double , while still passing in integers
To find the Max nth , use a very large nth say , 1,000,000 .
double Types can go larger then 1.0 E300 . However, FLOAT
results may not "roll over" in the same way that integer Types do.
So, test FLOAT use , to verify results are accurate .

When the Fib sequence starts with 1 1 the Max nth is 93

when the annotation editor is working again , I will place these corrections on the video .