Complete the fibonacci function that should compute the series of N (integer) elements of Fibonacci numbers (Links to an external site.) and put them into a global array, named "fib_array" (in the memory). (Note: You can assume "fib_array" will have enough space to place N elements.) >>> $a0 contains the N's value, which represents the number of elements of the Fibonacci number to be completed. ############################################################### # Text Section .text ############################################################### ############################################################### ############################################################### # PART 1 (Fibonacci) # # The Fibonacci Sequence is the series of integer numbers: # # 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... # The next number is found by adding up the two numbers before it. # The `2` is found by adding the two numbers before it (1+1) # The `3` is found by adding the two numbers before it (1+2), # And the `5` is (2+3), # and so on! # # You should compute N ($a0) number of elements of fibonacci and put # in array, named fib_array. # fibonacci: # $a0: Number of elements. # fib_array: The destination array. ################## Part 1: your code begins here ############### ############################## Part 1: your code ends here ### jr $ra Sample: Testing Fibonacci: fib(5) Expected output: 0, 1, 1, 2, 3
Complete the fibonacci function that should compute the series of N (integer) elements of Fibonacci numbers (Links to an external site.) and put them into a global array, named "fib_array" (in the memory). (Note: You can assume "fib_array" will have enough space to place N elements.)
>>> $a0 contains the N's value, which represents the number of elements of the Fibonacci number to be completed.
###############################################################
# Text Section
.text
###############################################################
###############################################################
###############################################################
# PART 1 (Fibonacci)
#
# The Fibonacci Sequence is the series of integer numbers:
#
# 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
# The next number is found by adding up the two numbers before it.
# The `2` is found by adding the two numbers before it (1+1)
# The `3` is found by adding the two numbers before it (1+2),
# And the `5` is (2+3),
# and so on!
#
# You should compute N ($a0) number of elements of fibonacci and put
# in array, named fib_array.
#
fibonacci:
# $a0: Number of elements.
# fib_array: The destination array.
################## Part 1: your code begins here ###############
############################## Part 1: your code ends here ###
jr $ra
Sample:
Testing Fibonacci: fib(5)
Expected output:
0, 1, 1, 2, 3
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
