In the Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, …., the next number is always the sum of the previous two . The following function calculates the nth Fibonacci number by calling itself recursivly:
unsigned int fib(unsigned int n)
if (n==1 || n==2)
return fib(n-2) + fib(n-1);
Professor Mobonacci has recently modified the Fibonacci sequence, where each number, f(n), in the sequence is f(n – 2) / 2 + f(n – 1) * 2 (Note: the division is integer division). The first two numbers are specified to be 1 and 2. So the sequence is 1, 2, 4, 9, 20, 44, 98, 218, … . In this assignment, you are asked to write a recursive function Mobonacci in assembly to calculate the nth number in such sequence. You also need to write a main function in c++ which reads a positive integer n, calls the Mobonacci assembly function with the parameter n, and the displays the result. You need to hand in a document (around 2-3 pages) describing your code, experiences in debugging your program, etc. In your report, you also need to draw how the stack grows and shrinks when the function Mobonacci is called with the parameter 5.
i have an assembler expirience on misc. platform - linux (2 or 3 kind of asm), win, and for different [url removed, login to view] (x86, arm). and i have the expirince in c/c++ coding I can do the job in 4 hours
14 freelancers are bidding on average $59 for this job
Hi, thanks for invitation to this project. What compiler should be used for the program? My full profile on this site: 250+ completed projects, customer rating 5.0/5 (click on my name).
I am great C/C++ developer from 7+ years of experience. Award me the project And i will finish it in less than 30 minutes for you. You can read my reviews. And you can trust me for fine work
Hi I have a Masters in Embedded systems and I have good experience working with MIPS,x86 assembly. I can do this assignment for you. PM me for more details
Hello. I've read all your requirements and ready to complete your project within 2 days. I have fully understood the task (I have only one extra question). Please contact me if you find me a worthy candidate.