Reply to thread

Message

<blockquote data-quote="kentb" data-source="post: 5311887" data-attributes="member: 591017">so here is the procedure in MIPS languagefor calculating Fibonacci number(Recursion)######################################################################&nbsp; Display fibonacci sequence.#&nbsp; The Fibonacci Sequence is defined as follows:#&nbsp; &nbsp; fibonacci<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)" loading="lazy" data-shortname="(n)" />#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if n=1 or n=0#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; fibonacci<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)" loading="lazy" data-shortname="(n)" /> = n#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if n &amp;gt;= 2#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; fibonacci<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)" loading="lazy" data-shortname="(n)" /> = fibonacci(n-2) + fibonacci(n-1)# -----#&nbsp; &nbsp; Arguments:#&nbsp; &nbsp; $a0 - n#&nbsp; &nbsp; Returns:#&nbsp; &nbsp; fibonacci<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)" loading="lazy" data-shortname="(n)" />.globl fibonacci.ent fibonaccifibonacci:####Save registers####sub $sp, $sp, 8sw $ra, ($sp)sw $s0, 4($sp)move $v0, $a0&nbsp; #number to $v0ble $a0, 1 , fib_donemove $s0, $a0 #copy the number to $s0sub $a0, $a0, 1jal fibonaccisub $a0, $s0, 2move $s0, $v0jal fibonacciadd $v0, $v0 ,$s0fib_done:####Restore Registers####lw $ra, ($sp)lw $s0, 4($sp)addu $sp, $sp, 8jr $ra.end fibonaccijust need to make a procedure that calculates Perrin numbermy prof said you just need to add a couple of lines of code on the fibonacci sequence procedure.here is the formula######################################################################&nbsp; Display perrin sequence.#&nbsp; The Perrin Sequence is defined as follows:#&nbsp; &nbsp; perrin<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)" loading="lazy" data-shortname="(n)" />#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if n=0#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; perrin<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)" loading="lazy" data-shortname="(n)" /> = 3#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if n=1#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; perrin<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)" loading="lazy" data-shortname="(n)" /> = 0#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if n=2#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; perrin<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)" loading="lazy" data-shortname="(n)" /> = 2#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if n &amp;gt; 2#&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; perrin<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)" loading="lazy" data-shortname="(n)" /> = perrin(n-2) + perrin(n-3)# -----#&nbsp; &nbsp; Arguments:#&nbsp; &nbsp; $a0 - n#&nbsp; &nbsp; Returns:#&nbsp; &nbsp; perrin<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down&nbsp; &nbsp; (n)" loading="lazy" data-shortname="(n)" />idk if there are programmers here. but fu.ck it, might as well try</blockquote>

[QUOTE="kentb, post: 5311887, member: 591017"] so here is the procedure in MIPS language for calculating Fibonacci number(Recursion) ##################################################################### # Display fibonacci sequence. # The Fibonacci Sequence is defined as follows: # fibonacci(n) # if n=1 or n=0 # fibonacci(n) = n # if n >= 2 # fibonacci(n) = fibonacci(n-2) + fibonacci(n-1) # ----- # Arguments: # $a0 - n # Returns: # fibonacci(n) .globl fibonacci .ent fibonacci fibonacci: ####Save registers#### sub $sp, $sp, 8 sw $ra, ($sp) sw $s0, 4($sp) move $v0, $a0 #number to $v0 ble $a0, 1 , fib_done move $s0, $a0 #copy the number to $s0 sub $a0, $a0, 1 jal fibonacci sub $a0, $s0, 2 move $s0, $v0 jal fibonacci add $v0, $v0 ,$s0 fib_done: ####Restore Registers#### lw $ra, ($sp) lw $s0, 4($sp) addu $sp, $sp, 8 jr $ra .end fibonacci just need to make a procedure that calculates Perrin number my prof said you just need to add a couple of lines of code on the fibonacci sequence procedure. here is the formula ##################################################################### # Display perrin sequence. # The Perrin Sequence is defined as follows: # perrin(n) # if n=0 # perrin(n) = 3 # if n=1 # perrin(n) = 0 # if n=2 # perrin(n) = 2 # if n > 2 # perrin(n) = perrin(n-2) + perrin(n-3) # ----- # Arguments: # $a0 - n # Returns: # perrin(n) idk if there are programmers here. but fu.ck it, might as well try [/QUOTE]

Verification