Project: Fibs and sorting
This project will help you understand that everything that can be done with recursion can be done with iteration; although the iteration solution may be more difficult to figure out.
Last updated
This project will help you understand that everything that can be done with recursion can be done with iteration; although the iteration solution may be more difficult to figure out.
Last updated
This project assumes you already have experience with loops, and that you've been doing some practice with your programming outside of this Computer Science course. This project will putting your ability to use recursion through a basic test, and allowing you to compare what you do with recursion with what you do with iteration (loops). This project will also help you understand that everything that can be done with recursion can be done with iteration; although the iteration solution may be more difficult to figure out.
This is an age-old classic example of something that can be solved recursively. The is a sequence where each number, or term, is the sum of the two terms before it; with the first two terms being 0 and 1. So your sequence is the following:
0, 1, 1, 2, 3, ...
In your language of choice...
Write a method #fibs which takes a number and returns that many members of the fibonacci sequence. Use iteration for this solution.
Now write another method #fibs_rec which solves the same problem recursively.
Run both these programs to find the first 5 terms. The result should look something like the example above!
Make a mental note of how long both these programs to solve your problem for 5 terms.
Now run both of these programs to find the first 30 terms.
Is there any noticeable differences in performance between the two programs? Can you figure out why?
This is a classic algorithm question; and one that lends itself very well to recursion, the topic at hand! It is an algorithm which, as the name suggests, tackles the problem of sorting data sets. This method of sorting arrays may be alien to you at first; but the main thing to keep in mind that this is a Divide and Conquer algorithm. Here is some background viewing to understand what merge sort is:
The first step is to actually understand what the merge sort algorithm is doing:
Build a method #merge_sort that takes in an array and returns a sorted array, using a recursive merge sort methodology.
Tips:
Think about what the base case is and what behavior is happening again and again and can actually be delegated to someone else (e.g. that same method!).
It may be helpful to check out the background videos again if you don't quite understand what should be going on.
(OPTIONAL) Build a second method #merge_sort_iter that achieves merging behaviour, but iteratively rather than recursively.
This section contains helpful links to other content. It isn't required, so consider it supplemental for if you need to dive deeper into something.
Check out from Harvard's CS50x course.
Check out by David J. Malan (watch only until 1:14:00).
and on YouTube give you a more formal look at this problem if you're still unclear.
Another look at
For more attempts at recursion try the first 5 problems in