Assignment 3. Recursion Etudes


Due Friday, October 21 at 11:59 pm

  • Submissions received by the due date receive a small on-time bonus.
  • Late work after the due date is accepted if within the grace period (48 hours for this assignment).
  • The grace period gives you the ability to self-grant an extension; we trust you will make reasonable and sparing use of this power.
  • The grace period expires Sun, Oct 23 at 11:59 pm, after which we do not accept further late work.
  • All due dates and submission times are expressed in Pacific time.

Recursion is a powerful problem-solving tool with many practical applications. This week's assignment is a recursion "sampler" that introduces recursive problem-solving through several small, independent tasks. Learning to solve problems recursively can be challenging at first. We think it's best to practice in isolation before adding the complexity of integrating recursion into a larger program. We'll get to that in future assignments!

Most students find that it takes some time to get comfortable thinking recursively. We recommend that you start the assignment early. Read over the problem statements today and get your brain starting to mull it over. There is not a large amount of code for you to write, but you want to give yourself plenty of time to wrap your head around this new way of solving problems. And while that beautiful recursive solution may be only a few elegant lines, you'll work hard on each line. Recursive code can be dense and complex and requires your full attention to get the details just right.

Dedicate yourself to deeply assimilating the foundation concepts within the context of these small, targeted problems. Lecture will continue on to explore more advanced applications of recursion. By next week, you'll be in prime shape to tackle recursive solutions for ever more impressive problems.

This assignment is to be completed individually. Working in pairs/groups is not permitted.

Learning goals

After completing this assignment, you will be able to…

  • Develop the recursive insight to decompose a problem into smaller, self-similar tasks.
  • Structure a recursive solution by dividing a problem into one or more base cases and one or more recursive cases.
  • Understand and trace execution through recursive function calls.
  • Apply techniques for testing, debugging, and analyzing recursive functions.

Assignment parts

This assignment consists of a short warmup exercise and four recursive functions.

  • Warmup

    Practice with unit tests and debugging and timing recursive functions.

  • Ballot counting

    How likely to have no change in leader when tallying ballots?

  • Balanced

    Determine whether an expression has properly matched pairs of bracketing characters.

  • Sierpinski Fractal

    Draw a beautiful self-similar fractal triangle.

  • Merging Sorted Sequences

    Implement an efficient divide-and-conquer algorithm for merging a collection of sorted sequences.

Getting started

We provide a ZIP of the starter project. Download the zip, extract the files, and open the .pro file in Qt Creator.

📦 Starter code

The source files you will edit are ballots.cpp, balanced.cpp, sierpinski.cpp, and merge.cpp

Additionally, you will answer questions in short_answer.txt.

Resources

Here are some resources that you might find helpful for this assignment:

Getting help

Recursion can take some time to get used to, so don’t be dismayed if you can’t immediately sit down and solve these problems. Ask for advice and guidance if you need it. Once everything clicks, you’ll have a much deeper understanding of just how cool a technique this is.

Look for an announcement on the Ed forum for the YEAH session for this assignment. If you have questions for us, the Ed forum is open 24/7 for general discussion. Always start by searching first to see if your question has already been asked and answered before making a new post. To troubleshoot a problem with your specific code, your best bet is to bring it to the LaIR helper hours or office hours.

Submit

Before you call it done, run through our submit checklist to be sure all your ts are crossed and is dotted. Then upload your completed files to Paperless for grading.

Please submit only the files you edited; for this assignment, these files will be:

  • ballots.cpp
  • balanced.cpp
  • sierpinski.cpp
  • merge.cpp
  • short_answer.txt

🏁 Submit to Paperless

Note: On Paperless, all due dates and submission times are expressed in Pacific time.