Write a recursive function named printStars which receives an int parameter. If the parameter is positive, the function prints the given number of asterisks; otherwise the function does nothing. The function does not return a value. Thus, if the printStars(8) is called, ******** (8 asterisks) will be printed. The function must not use a loop of any kind to accomplish its job. Instead, it gets the job done by (recursively) calling itself.

Write a recursive function named printStars which receives an int parameter. If the parameter is positive, the function prints the given number of asterisks; otherwise the function does nothing. The function does not return a value. Thus, if the printStars(8) is called, ******** (8 asterisks) will be printed. The function must not use a loop of any kind to accomplish its job. Instead, it gets the job done by (recursively) calling itself.

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 12PE

See similar textbooks

Similar questions

Please write in c++, and use the recursion to solve this problem, thanks in advance! For this assignment, you will write a function that takes two strings. int findDistributedString(string haystack, string needle);and returns the number of times that needle appears in haystack. The characters in needle must appear in the right order in the haystack string, but they do not have to appear side-byside.For example, if haystack is "call me Ishmael" and needle is "meal", yourfunction should return 1, because "meal" appears in "call me Ishmael" once: call me Ishmael
Write C++ code. Write a recursive function, reverseDigits, that takes an integer as a parameter and returns the number with the digits reversed. Write output also.
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 C++ recursive function PrintPattern3 to print following pattern using recursion. No loops allowed whatsoever, and you can write maximum two functions apart from main function. For example, calling your function with these argument PrintPattern1(1,5) should print following pattern. Your function prototype must be as follows recursive function.void PrintPattern3(int start, int end);
Need help with this c++ problem Write a recursive function named lettersOnly that accepts a string str as a parameter and returns a string with the same characters as str, in the same order, but excluding any characters that are not alphabetic letters from A-Z, case-insensitive. For example, lettersOnly("{[[Friends, save $$$ with 'Geico'!!]]}") should return "FriendssavewithGeico".
Write a C++ program that checks if a number is Palindrome (use recursive function as you code). 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 program should receive an integer number as the input and always work with integer types, i.e., you cannot use string or char types throughout your code. You cannot convert the input to a string.)
In C++ Consider the following recursive function (Chapter 17, #9, modified) void recFun(int x) { if (x > 10) { recFun(x / 10); cout<< x % 10; } else cout<< x; } How can the code be modified so that the sum of all digits is printed?
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 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.
C++ Programming: Write a recursive function, sumDigits, that takes an integer as a parameter and returns the sum of the digits of the integer. Also, write a program to test your function. Your program should prompt the user for an integer and output the results to the console.
What is the return value of the function call Comp(4, 5), given the recursive function Comp defined below: int Comp(int a, int b) { if (a + b <= 6) return 3; else return Comp(a-1, b) + Comp(a, b-1); }
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) );