For this exercise, you are going to write a recursive function that counts down to a Blastoff! Your recursive function will not actually print. It will return a String that can be printed from the main function. Each recursive call will add on to that string. In your main function, prompt the user for a starting value, then print the results. Sample Output Please enter a number to start: 5 5 4 3 2 1 Blastoff! import java.util.Scanner; public class Countdown { public static void main(String[] args) { // Start here } public static String countdown(int number) { // Base case - return Blastoff! // Recursive call } }

For this exercise, you are going to write a recursive function that counts down to a Blastoff! Your recursive function will not actually print. It will return a String that can be printed from the main function. Each recursive call will add on to that string. In your main function, prompt the user for a starting value, then print the results. Sample Output Please enter a number to start: 5 5 4 3 2 1 Blastoff! import java.util.Scanner; public class Countdown { public static void main(String[] args) { // Start here } public static String countdown(int number) { // Base case - return Blastoff! // Recursive call } }

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

See similar textbooks

Sample Output

Please enter a number to start: 5 5 4 3 2 1 Blastoff!

import java.util.Scanner;

public class Countdown
{
public static void main(String[] args)
{
// Start here

}

public static String countdown(int number)
{

// Base case - return Blastoff!

// Recursive call

}
}

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2 Execution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Write a recursive function that converts a decimal number into a binary number as a string. The function header is as follows:def decimalToBinary(value): Write a test program that prompts the user to enter a decimal number and displays its binary equivalent.
Write a recursive function that displays a string reversely on the console using the following header: void reverseDisplay(const string& s) For example, reverseDisplay("abcd") displays dcba. Write a test program that prompts the user to enter a string and displays its reversal.
Write a recursive function that displays an integer value reversely on the console using the following header:def reverseDisplay(value):For example, invoking reverseDisplay(12345) displays 54321. Write a testprogram that prompts the user to enter an integer and displays its reversal.
Write a recursive function that displays a string reversely on the console using the following header: def reverseDisplay(value):For example, reverseDisplay("abcd") displays dcba. Write a test programthat prompts the user to enter a string and displays its reversal.
Help me please: A palindrome is a string that reads the same both forward and backward. For example, the string madam is a palindrome. Write a program that uses a recursive function to check whether a string is a palindrome. Prompt the user for a string. If the string is a palindrome output a message in the following format: madam is a palindrome else Hello is not a palindrome Your program must contain a value-returning recursive function that returns true if the string is a palindrome and false otherwise. Do not use any global variables; use the appropriate parameters.
Write a recursive function that parses a hex number as a string into a decimal integer. The function header is as follows:def hexToDecimal(hexString):Write a test program that prompts the user to enter a hex string and displays its decimal equivalent.
Write a recursive function to return the number of uppercase letters in a string using the following function headers:def countUppercase(s):def countUppercaseHelper(s, high): Write a test program that prompts the user to enter a string and displays the number of uppercase letters in the string.
Write a recursive function called digit_count() that takes a positive integer as a parameter and returns the number of digits in the integer. Hint: The number of digits increases by 1 whenever the input number is divided by 10. Ex: If the input is: 345 the function digit_count() returns and the program outputs: 3 # TODO: Write recursive digit_count() function here. if __name__ == '__main__': num = int(input()) digit = digit_count(num) print(digit)
Write a recursive function diff which takes two positive integer arguments (x and y) and returns |x – y|. You may not perform an x - y calculation anywhere in the function! Example calls: diff(3, 7) returns 4; diff(7,3) returns 4 In JAVA
Write a recursive function that finds the number of occurrences of a specified letter in a string using the following function header. def count(s, a):For example, count("Welcome", 'e') returns 2. Write a test program thatprompts the user to enter a string and a character, and displays the number of occurrences for the character in the string.
JAVA Remember to look at the examples input and output at the bottom! Implement the recursive function such that creates an unfilled triangle with the base of the number inputted by the user as shown at the link at the bottom. Notice that the spaces in between the stars start on the 3rd row asterix and the bottom row is always filled with the number the user inputs. You may pass in any parameters you want into the function. There is no test cases. Requirements A) Parameters picked such that enables the recursive functionality B) Uses the user input to do recursion with the number the user enters as the base of the triangle (see below) C) Has a base case that stops the recursion D) Prints out the correct shape user input 2 * ** user input 3 * ** *** user input 4 * ** * * **** user input 5 * ** * * * * ***** user input 6 * ** * * * * * * ******
Write a program that asks the user to enter a binary string and you must use this binary string as an input to your functions. These functions that are to be created will be recursive functions that return the decimal number equivalent of your binary string input. For this exercise, you will develop 2 different ways of solving this problem: • Implementation 1: A recursive function with two inputs: a binary string, and a number. (Hint: You can think of this number as the index that allows you to access each element in your sequence.) • Implementation 2: A recursive function with only one input: the binary string. Conditions: Do implementation 1 if the binary string starts with a '0'. Otherwise, do implementation 2 if the binary string starts with '1'. Before you return a value in your recursive function's base case, print a statement that reveals the identity of the function that is currently being used.