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.

Expert Solution

Source Code:

Output:

Code in text format (See above images of code for indentation):

#include <iostream>
using namespace std;

/*main function*/
int main()
{
   /*function prototype*/
   int sumDigits(int);
   /*variables*/
   int n,sum;
   /*read an integer from user*/
   cout<<"Enter an integer: ";
   cin>>n;
   /*function call*/
   sum=sumDigits(n);
   /*print sum*/
   cout<<"The sum of digits is: "<<sum;
   return 0;
}
/*function definition*/
int sumDigits(int n)
{
   if(n==0)
       return n;
   /*recursive call by adding digits*/
   else
       return (n%10)+sumDigits(n/10);
}

venereology answered 1 year ago

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

Write a recursive a c++ code that checks if a number is Palindrome. A palindrome number...

Write a recursive a c++ code that checks if a number is Palindrome. A palindrome number is a number that reads the same from beginning to end and from end to beginning, in other words, a palindrome number remains the same when its digits are reversed. For example, 13431 is a palindrome number. 2332 is another one. (Note: Your algorithm should define and work with an integer number) The functionality of your code should be commented to explain what you...

write code to manage a linked list using recursive approach. (Using this code) C++ IN Unix....

write code to manage a linked list using recursive approach. (Using this code) C++ IN Unix. // app.cpp #include <iostream> #include "linkedlist.h" using namespace std; void find(LinkedList& list, char ch) { if (list.find(ch)) cout << "found "; else cout << "did not find "; cout << ch << endl; } int main() { LinkedList list; list.add('x'); list.add('y'); list.add('z'); cout << list; find(list, 'y'); list.del('y'); cout...

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.

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) }

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

Question