The first and second numbers in the Fibonacci sequence are both 1. After that, each subsequent number is the sum of the two preceding numbers. The first several numbers in the sequence are: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, etc. Write a function named fib that takes a positive integer parameter and returns the number at that position of the Fibonacci sequence. For example fib(1) = 1, fib(3) = 2, fib(10) = 55, etc. Your function does not need to print anything out - just return a value. For example, your function could be called like this: term = fib(17) You cannot use recursion, since we haven't covered that technique. That means that for this assignment you cannot have your function call itself. This includes indirect recursion, such as one function calling a second function that calls the first function. You must use a loop to step through the sequence - do not use the golden ratio to directly calculate the value.
The first and second numbers in the Fibonacci sequence are both 1. After that, each subsequent number is the sum of the two preceding numbers. The first several numbers in the sequence are: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, etc. Write a function named fib that takes a positive integer parameter and returns the number at that position of the Fibonacci sequence. For example fib(1) = 1, fib(3) = 2, fib(10) = 55, etc. Your function does not need to print anything out - just return a value. For example, your function could be called like this: term = fib(17) You cannot use recursion, since we haven't covered that technique. That means that for this assignment you cannot have your function call itself. This includes indirect recursion, such as one function calling a second function that calls the first function. You must use a loop to step through the sequence - do not use the golden ratio to directly calculate the value.
C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter6: Modularity Using Functions
Section6.4: A Case Study: Rectangular To Polar Coordinate Conversion
Problem 9E: (Numerical) Write a program that tests the effectiveness of the rand() library function. Start by...
Related questions
Question
![The first and second numbers in the Fibonacci sequence are both 1. After that, each subsequent number is the sum of the two
preceding numbers. The first several numbers in the sequence are: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, etc. Write a function named
fib that takes a positive integer parameter and returns the number at that position of the Fibonacci sequence. For example fib(1) =
1, fib(3) = 2, fib(10) = 55, etc. Your function does not need to print anything out - just return a value.
For example, your function could be called like this:
term = fib(17)
You cannot use recursion, since we haven't covered that technique. That means that for this assignment you cannot have your
function call itself. This includes indirect recursion, such as one function calling a second function that calls the first function. You
must use a loop to step through the sequence - do not use the golden ratio to directly calculate the value.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F602eda94-17a1-49b5-9995-2880ea0a6cd3%2F348d6b3f-4c1d-4e87-937f-c8ba31ee0935%2Fjp8ppoo_processed.png&w=3840&q=75)
Transcribed Image Text:The first and second numbers in the Fibonacci sequence are both 1. After that, each subsequent number is the sum of the two
preceding numbers. The first several numbers in the sequence are: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, etc. Write a function named
fib that takes a positive integer parameter and returns the number at that position of the Fibonacci sequence. For example fib(1) =
1, fib(3) = 2, fib(10) = 55, etc. Your function does not need to print anything out - just return a value.
For example, your function could be called like this:
term = fib(17)
You cannot use recursion, since we haven't covered that technique. That means that for this assignment you cannot have your
function call itself. This includes indirect recursion, such as one function calling a second function that calls the first function. You
must use a loop to step through the sequence - do not use the golden ratio to directly calculate the value.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![C++ for Engineers and Scientists](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
![C++ for Engineers and Scientists](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr