Purchase Solution

problem using recursion

Not what you're looking for?

Ask Custom Question

Please provide a little guidance on how to solve the following problem using recursion. I can understand solving it using iteration .. but not recursion.

Design a game called Jump it.
It consists of a board of n integers rows. All containing positive integers except the first one always containing 0.

The object is to move from the first to the last column. With each jump the interger in the column is added to a sum. The goal is to move to the last column having the lowest sum.
Moves consist of either moving to the adjacent column or skipping 2 cols and jumping to the next one.

The board consists of an array.

Examples:
0 - 3 - 80 - 6 - 57 - 10 ===> 3+6+10=19
0 - 3 - 5 - 4 - 1 - 10 ====> 5+1+10 =16.

Purchase this Solution
Solution Summary

A problem using recursion is shown.

Solution Preview

We define the recursion function JUMP (A), where A is the input array, as follows:

Let A has n element
int JUMP(A) {
if (A is empty)
return 0;
...

Purchase this Solution
Free BrainMass Quizzes
Javscript Basics

Quiz on basics of javascript programming language.

Basic Networking Questions

This quiz consists of some basic networking questions.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

View More Free Quizzes
Related BrainMass Solutions

  • c++ recursion

    Code for hanoi tower problem is written using Recursion method.

  • recursion formula

    46893 Recursion formula What would the recursion formula be for that problem. Please see attachment. see attachment. Solution.

  • Recursion

    106577 Recursion Recursion. See attached file for full problem description.

  • Bessel functions

    Please see the attached document for a complete solution to this problem. Thanks for using BrainMass.com. The solution method uses a recursion relation and the Bessel functions J_{1/2} and J_{-1/2} in conjunction with a proof by induction.

  • Discrete Math:Recursion

    This is the idea behind recursion because recursive algorithm break down a problem into smaller pieces in which you either already know the answer and can solve by applying the same algorithm to each piece and combine the results.

  • Reversing integer using recursion

    181080 Reversing integer using recursion I need a recursive function that accepts an integer and returns its reverse.

  • Radial Wave Function

    Michael Douglass This solution provides explanation for the student to be able to understand the problem and develop exact answer on their own.

  • Recursion implementation

    310469 Recursion implementation Rewrite the following power() function so that it uses recursion. Provide a function main to test your implementation.

  • C++ recursion program

    308595 Recursion Implementation 1. Modify this pop() function, so that it uses recursion. int Stack::pop() { if (isEmpty()) { cerr << "Attempting to Pop from an Empty stack!!"

View More Related Solutions