Write a recursive function definition in C that will calculate the sum of the first n odd integers (all odd integers between 1 and 2n - 1). This mathematical function is defined as: 2*n - 1 + oddSum(n - 1 ), It n 2 1, or oddsum(n) 0, It n ≤ 0 Add a main function to your program that tests your oddSum function with THREE different values of n. You don't need any input with scant for this - just put in three statements like this: printf( "oddsum (10) = %d\n" , oddsum (10) );

Write a recursive function definition in C that will calculate the sum of the first n odd integers (all odd integers between 1 and 2n - 1). This mathematical function is defined as: 2*n - 1 + oddSum(n - 1 ), It n 2 1, or oddsum(n) 0, It n ≤ 0 Add a main function to your program that tests your oddSum function with THREE different values of n. You don't need any input with scant for this - just put in three statements like this: printf( "oddsum (10) = %d\n" , oddsum (10) );

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Write a recursive function in C that returns a value of 1 if its string argument is apalindrome and zero otherwise.* Note that for the function parameters, you need to accommodate for the shrinkingstring, so that the string shrinks both from beginning and end after each recursive call.** Think about the simple cases or base cases. The 2 base cases have conditions thatwould return 0 and return 1 independently.For the palindrome, create a driver program. First ask the user to enter anystring through the keyboard. Then remove all the spaces and punctuations from thestring. Also, remove any letter capitalization from the string. Finally, pass the string tothe palindrome function through a function call.
(Using the programming language C, answer the following question) Write recursive C functions to do the following: Example: int summ(int n) returns the summation of integers from 0 to n. Here is the code. int summ(int n) { if(n < 0) return -1; if(n == 0) return 0; return n + summ(n - 1);} 1) If n is less than 0, the expression int bunnyEars(int n) returns -1; otherwise, it returns the number of ears for n bunnies. int factorial(int n) returns -1 if n is less than 0, otherwise returns the factorial of n. If n is greater than or equal to 0, the expression int fib(int n) returns -1; otherwise, it returns fib of n - 1 + fib of n - 2. (This will run quite slowly if you test it with more than roughly 50 digits.). int posPow(int base, int exp) returns -1 if exp is less than 0, otherwise returns base raised to the power exp. Write a main() that tests all the other functions thoroughly.
Implement a recursive C++ function which takes a character (ch) and a positive integer (n) and prints thecharacter ch, n times on the screen. The prototype of your function should be:void printChar (char ch, int n)For example, calling printChar('*',5) should display ***** on screen.Note: There should NOT be any loop in your function.
In C++ Write a recursive function called PrintNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. For this lab, do not end output with a newline. Ex. If the input is: 123 the output is: 12 9 6 3 0 3 6 9 12 #include <iostream> using namespace std; // TODO: Write recursive PrintNumPattern() function int main(int argc, char* argv[]) { int num1; int num2; cin >> num1; cin >> num2; PrintNumPattern(num1, num2); return 0;}
In this lab, we will practice: Implementing recursive function printing in a recursive function (before and after the recursion function call) working on setting the base and general cases for the recursion function Instructions Write a recursive function called print_num_pattern() to output the following number pattern. Given two positive integers as input (Ex: 12 3), subtract the second integer (3) from the first one (12) and print the result continually until 0 or a negative value is reached. Then continually print the result of the addition of the second integer to the last value you reached from the subtraction (zero or negative) until the first integer is reached again. Note: For this lab, do not end output with a newline. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12 Hint You do not need to actually do addition. You can write statements i.e. printing statements after the recursion function call.
Write a recursive function that returns true if the digits of a positive integer are in increasing order; otherwise, the function returns false. Also, write a program to test your function.
Write a small C++ program that defines a recursive function GCD based on the model of the Lisp function (defun gcd (n m)"Returns the gcd of two numbers" (let ((dividend n) (divisor m) (remainder 1)) (while (/= remainder 0) (setq remainder (mod dividend divisor)) (setq dividend divisor) (setq divisor remainder)) dividend)) In the main function, write a loop (while or do) that repeats the following actions: ask the user to enter two numbers, compute their GCD and output it, until the user enters 0 for one of the numbers.
In C programing Write a recursive function that returns the product of the digits of its integer input parameter, n. You may assume that n is non-negative. For example, productDigits(243) should return 24, since 2 x 4 x 3 = 24.int productDigits (int n) {
In lisp Write a simple recursive function to compute the f(n) for the following sequence: f(n) = f(n-1) + f(n-3) f(0) = 0, f(1) = f(2) = 1 Optimize this function using dynamic programming. You can assume that the number n in the function call for testing will be less than 20.
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, the pattern generated is as follows: **** *** ** * * ** *** **** Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For example, specifying 4 as the number of lines generates the preceding pattern.
Write a recursive C++ program to find the GCD of two numbers and using this write a function to find the L.C.M of two numbers in O(1) time. GCD function should contain one line of code. Please answer only if you can fulfill the conditions else I will downvote.
Write a recursive function that returns a value of 1 if its string argument is apalindrome and zero otherwise.* Note that for the function parameters, you need to accommodate for the shrinkingstring, so that the string shrinks both from beginning and end after each recursive call.** Think about the simple cases or base cases. The 2 base cases have conditions thatwould return 0 and return 1 independently.For the palindrome, create a driver program. First ask the user to enter anystring through the keyboard. Then remove all the spaces and punctuations from thestring. Also, remove any letter capitalization from the string. Finally, pass the string tothe palindrome function through a function call.