In the case of c++, how would I store data drom a recursive function into a...

In the case of c++, how would I store data drom a recursive function into a 2D array?

Solutions

Expert Solution

/* The following function illustrate storing of values in 2d array using recursion*/

#include<iostream>
using namespace std;

int fib(int n)
{
   if (n <= 1)
       return n;
   return fib(n-1) + fib(n-2);
}

int main ()
{
   int n = 9,i1=0;
   int a[3][3];
   for(int i=0;i<3;i++){
   for(int j=0;j<3;j++){
   a[i][j]=fib(i1);
   i1++;
   }
   }
   return 0;
}

venereology answered 9 months ago

Next > < Previous

Related Solutions

it should be c++ data structure Write a recursive function that draws the following shape. X...

it should be c++ data structure Write a recursive function that draws the following shape. X XXX XXXXX XXXXXXX XXXXXXXXX XXXXXXXXX XXXXXXX XXXXX XXX X The length of the longest row in the shape and the shape's character are function parameters. In above shape the longest row is 9 and the pattern's character is "X”.

C++ Ackermann’s function is a recursive mathematical algorithm that can be used to test how well...

C++ Ackermann’s function is a recursive mathematical algorithm that can be used to test how well a computer performs recursion. Write a function A(m, n) that solves Ackermann’s function. Use the following logic in your function: If m = 0 then return n + 1 If n = 0 then return A(m−1, 1) Otherwise, return A(m–1, A(m, n–1)) Test your function in a driver program that displays the following values: A(0, 0) A(0, 1) A(1, 1) A(1,...

Write a short recursive C++ function that determines if a string s is a palindrome, that...

Write a short recursive C++ function that determines if a string s is a palindrome, that is, it is equal to its reverse. For example,"racecar" and "gohangasalamiimalasagnahog" are palindromes. Please include the pseudo code so that I can understand better with simple English as much as possible.

Code needed in C++ (nOT IN STEP BY STEP EITHER) Write a recursive function that...

Code needed in C++ (nOT IN STEP BY STEP EITHER) Write a recursive function that computes the sum of the digits in an integer. Use the following function header: int sumDigits(int n) For example, sumDigits(234) returns 2 + 3 + 4 = 9. Write a test program that prompts the user to enter an integer and displays its sum.

In c++ Write a recursive driver function that will replace each of the odd values in...

In c++ Write a recursive driver function that will replace each of the odd values in a stack with the cube of the value.

Write a recursive function to calculate and return factorial of a given number 'n'. in C...

Write a recursive function to calculate and return factorial of a given number 'n'. in C progrmaining

C++ Write a recursive function that computes and returns the product of the first n >=1...

C++ Write a recursive function that computes and returns the product of the first n >=1 real numbers in an array.

(C++ ) ·In “recursive.cpp”, write a recursive function minDoub() which: ·returns the address of the smallest...

(C++ ) ·In “recursive.cpp”, write a recursive function minDoub() which: ·returns the address of the smallest value in the array. If the array is empty, return the “end” pointer ·and takes as parameters: (1) a pointer to double. The pointer is the address of the start of an array, (2) the “end” pointer to the address after the array (3) and the address of the smallest value seen so far ·Write main() to test this function – try a case where the array...

Determine if each of the following recursive definition is a valid recursive definition of a function...

Determine if each of the following recursive definition is a valid recursive definition of a function f from a set of non-negative integers. If f is well defined, find a formula for f(n) where n is non-negative and prove that your formula is valid. f(0) = 1, f(n) = -f(n-1) + 1 for n ≥ 1 f(0) = 0, f(1) = 1, f(n) = 2f(n-1) +1 for n ≥ 1 f(0) =0, f(n) = 2f(n-1) + 2 for n ≥...

C++ This needs to be a recursive combinational array please. This NEEDS to be recursive and...

C++ This needs to be a recursive combinational array please. This NEEDS to be recursive and no vectors. Thank you Write a program that solves the knapsack problem recursively for an arbitrary knapsack capacity and series of weights. Assume the weights are sorted in an array. Hint: The arguments to the knapsack function are target weight and the array index where the remaining items start. The knapsack problem in its simplest form involves trying to fit items of different weights...

Subjects