First question: Recursion and non-recursion of Fibonacci sequences
Non-recursive:
650) this.width=650; "Src=" Http://s1.51cto.com/wyfs02/M00/82/EF/wKiom1dl-8rD92igAAB-pImrC88891.png-wh_500x0-wm_3 -wmp_4-s_582408408.png "title=" series non-recursive pictures. png "alt=" wkiom1dl-8rd92igaab-pimrc88891.png-wh_50 "/>
Recursion:
650) this.width=650; "Src=" Http://s5.51cto.com/wyfs02/M00/82/EE/wKioL1dmAtGDO4NBAADA3Qh0kR0840.png-wh_500x0-wm_3 -wmp_4-s_2210701244.png "title=" recursive picture. png "alt=" wkiol1dmatgdo4nbaada3qh0kr0840.png-wh_50 "/>
Note that the range of return under the shell is 0-255, which cannot be used RETURN1
Second question: string intercept cut
650) this.width=650; "Src=" Http://s4.51cto.com/wyfs02/M02/83/00/wKioL1doloqwCEvpAABqPWtm1m8093.png-wh_500x0-wm_3 -wmp_4-s_3006264771.png "title=" string intercept. png "alt=" wkiol1doloqwcevpaabqpwtm1m8093.png-wh_50 "/>
Question three: Ask for 100 numbers
The first type of non-recursive:
650) this.width=650; "Src=" Http://s4.51cto.com/wyfs02/M01/83/01/wKiom1doma3gMPqOAAB1EPzrEaQ509.png-wh_500x0-wm_3 -wmp_4-s_1076067697.png "title=" sum non-recursive. png "alt=" wkiom1doma3gmpqoaab1epzreaq509.png-wh_50 "/>
The second kind of recursion
650) this.width=650; "Src=" Http://s5.51cto.com/wyfs02/M02/83/01/wKioL1dopv_CuJktAABv4l07Yd4719.png-wh_500x0-wm_3 -wmp_4-s_4142792152.png "title=" summation recursion. png "alt=" wkiol1dopv_cujktaabv4l07yd4719.png-wh_50 "/>
The Third kind of tool
650) this.width=650; "Src=" Http://s2.51cto.com/wyfs02/M01/83/01/wKioL1dop3jiCWHbAAAck5VGulc203.png-wh_500x0-wm_3 -wmp_4-s_1167999526.png "title=" summation tool. png "alt=" wkiol1dop3jicwhbaaack5vgulc203.png-wh_50 "/>
Fourth: The maximum value of three numbers, the minimum value, the average
650) this.width=650; "Src=" Http://s2.51cto.com/wyfs02/M01/83/02/wKiom1dop7iw7htOAACLVaC7GTc429.png-wh_500x0-wm_3 -wmp_4-s_1182994542.png "title=" three-digit average, maximum minimum value. png "alt=" wkiom1dop7iw7htoaaclvac7gtc429.png-wh_50 "/>
Basic algorithm programming for shell scripts