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?

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 1 year ago

C++ Recursive Functions: Please call functions in a main function as well. 1. A recursive function...

C++ Recursive Functions: Please call functions in a main function as well. 1. A recursive function that print the reverse of a string. (e.g., void printReverse(string exp)). For example, if exp =”coding”, then the function should print out “gnidoc”. 2. Implement a non-recursion-based binary search function. Convert this function into a recursion-based function. 3. Implement a recursive and non-recursive Fibonacci function.

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,...

For C++ Function 1: Write a recursive function to perform a sequential search on a set...

For C++ Function 1: Write a recursive function to perform a sequential search on a set of integers The function will require an array parameter and the number to look for. These are the minimal parameter requirements The function should take an array of any size Function 2: Write a recursive function that will convert an integer (base 10) to binary The function should only have an integer parameter Have the function write the binary number to the console You...

C++ Recursion, Change the delete_node function in the header file to a recursive delete_node function, main...

C++ Recursion, Change the delete_node function in the header file to a recursive delete_node function, main is already set. Hint: It might be helpful to modify the function so that it uses a separate recursive function to perform whatever processing is needed. //////////////////////////////////////////////////////////////header.h////////////////////////////////////////////////////////////////////////////////////////////// #ifndef HEADER_H_ #define HEADER_H_ #include <iostream> using namespace std; template <class T> class LL { private: struct LLnode { LLnode* fwdPtr; T theData; }; LLnode* head; public: LL();...

c++ using recursive no loops (for ,while ..ect)not allowed Write a recursive function ‘bool palindrome(string s)’...

c++ using recursive no loops (for ,while ..ect)not allowed Write a recursive function ‘bool palindrome(string s)’ that returns true if s is a palindrome and false if not. #5: Write a recursive function 'void reverse(string &word)' that reverses the given input string. string name = "damian"; reverse(name); cout << name << endl; //should display "naimad". #7: Write a function 'int numTwos(int n)' which returns the number of 2's in the base-4 expansion of n. cout << numTwos(2170) << endl; //...

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 in C++ that creates a copy of an array of linked lists....

Write a recursive function in C++ that creates a copy of an array of linked lists. Assuming: struct node { int data; node * next; }; class arrayList { public: arrayList(); ~arrayList(); private: node ** head; int size; //(this can equal 10) }

Question