Programming Fundamentals III Recursive functions, or functions that call themselves, can be an…

Programming Fundamentals III

Recursive functions, or functions that call themselves, can be an alternative to loops to solve tasks that can easily be broken down into smaller sub-problems of the original. In this lab, you will begin to practice with writing and calling recursive functions.
EXAMPLE PROGRAM The example program this week implements a recursive solution to calculate the values of the Fibonacci Sequence. It also calculates those same values iteratively, using only a loop, and displays information about the amount of time required to calculate each solution. In the case of the Fibonacci sequence, we’ll see from this program that recursion is not always the most efficient answer – the extra overhead of managing all of those repeated function calls slows things down considerably as values increase.
YOUR PROGRAM Press any key to continue The Collatz Conjecture is a conjecture in mathematics that concerns a sequence sometimes known as hailstone numbers. Given any positive integer n, the following term, n+1 is calculated as follows: . If n is even, then n+1 is defined as n/2. • If n is odd, then n+1 is defined as 3n+1 The Collatz Conjecture states that, for any value of n, the sequence will always reach 1.
Once the pattern reaches 1, it repeats indefinitely (3 * 1+1 = 4, 4/2 = 2, 2/2 = 1) For your lab, you will write a recursive function to calculate and display the sequence of hailstone numbers from any initial starting point, n, until it reaches 1. Additionally, after the sequence terminates at 1, you should print out the number of steps that were required to reach that point. Notes: . The Collatz Conjecture is unproven, but works for every case ever tested. For the purpose of this lab, we will assume it works in all cases, so you can rely on the sequence always reaching 1. Counting the number of recursions required can be handled in a number of different ways, including additional parameters to the function or a static local variable. The choice is yours. . When you are done, submit your completed.cpp file through the Blackboard submission tool

Place your order
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more
error: Content is protected !!