Write a recursive function named largestDigit that accepts an integer parameterand returns the largest digit value that appears in that integer. Your function shouldwork for both positive and negative numbers. If a number contains only a single digit,that digit's value is by definition the largest.You must not use any loops; you also cannot use the string type or any libraryfunctions. Your function must be recursive.Complete the following file:largestDigit.cpp2 // You may use this helper function3 int max(int a, int b) { return a < b ? b : a; }45 int largestDigit(int n)if((n<0) && (n/10if(n<0) n =0)) return n;8-n;static int maxi9n%10;0) return maxi;maxi = max(maxi, n%10);return largestDigit(n/10);=10if((n/10)111213141516 }SubmitCalling with ArgumentsNameArguments Actual Expectedpass largestDigit 13572577pass largestDigit 11121122faillargestDigit 1000001pass largestDigit 45300215pass largestDigit 7639852faillargestDigit 763526pass largestDigit 66655544466pass largestDigit 124242244pass largestDigit 12425266pass largestDigit o670O

Write a recursive function named largestDigit that accepts an integer parame and returns the largest digit value that appears in that integer. Your function should work for both positive and negative numbers. If a number contains only a single di hat digit's value is by definition the largest.

Write a recursive function named largestDigit that accepts an integer parame and returns the largest digit value that appears in that integer. Your function should work for both positive and negative numbers. If a number contains only a single di hat digit's value is by definition the largest.

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

Related questions

Q: The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13,…

A: #include <iostream>using namespace std;int fibSeries(int n) { if((n==1)||(n==0)) {…

Q: Write a recursive function that finds and returns the minimum element in an array, where the array…

A: Given:

Q: Write a recursive function for Euclid's algorithm to find the greatest common divisor (gcd) of two…

A: Recursive function using euclid’s algorithm:- int gcd_func(int p, int q){ if (q == 0) {…

Q: A recursive function is a function defined in terms of itself via self-referential expressions. This…

A: Required: A recursive function is a function defined in terms of itself via self-referential…

Q: Write a recursive function print that, given an integer number p > 0, prints counting forward from 1…

A: #include<iostream>using namespace std;//recursive functionvoid print(int p){ //base…

Q: Below,enter code to complete implementation of a recursive function sum_all_integers(), which takes…

A: As no programming language is mentioned, it is solved using Python

Q: Write a recursive function (no auxiliary functions, for/while loops, STL containers or functions,…

A: The C++ code for the given question is: #include <iostream>using namespace std; //the asked…

Q: Write a recursive function concat str(st) which takes as parameter a list of strings (Ist) and…

A: def concat_str(lst): if len(lst) == 1: return lst[0] else: return lst[0] +…

Q: Write a recursive version of the function reverse(s), which reverses thestring s in place.

A: Given: Write a recursive version of the function reverse(s), which reverses thestring s in place.

Q: using python! Write a recursive function stars that excepts a positive integer as an argument and…

A: Python is used to answer this question.

Q: Implement a recursive function called evens that returns an integer with only theeven numbers. Note…

A: The evens function checks for the modulo 2 div value at each position of the input array and…

Q: Write a recursive function to implement the recursive algorithm (determining the number of ways to…

A: Recursion is a computer programming process in which a function repeatedly calls itself during its…

Q: Write a function that will calculate the sum of all the numbers multiple of 3 from 1 to n using…

A: The program is written in C language. Please find the source code and code comments in the following…

Q: Write a recursive function count_odds(Ist) which takes as parameter a list of numbers (Ist) and…

A: The program for the above given question is given below:

Q: Write a recursive function that returns the product of the digits of its input parameter.

A: Program: // C# programusing System;// Class declarationclass ProductClass { // Function to find…

Q: 1. The digital root of a number is obtained by summing up the digits repeatedly until only a single…

A: To trace the recursive calls of the given function:

Q: Write a recursive function concat_str(Ist) which takes as parameter a list of strings (Ist) and…

A: def concat_str(lst): if len(lst) == 1: return lst[0] else: return lst[0] +…

Q: The Polish mathematician Wacław Sierpiński described the pattern in 1915, but it has appeared in…

A: The, code has given below:

Q: Consider the following recursive function: { a if b = 0, %3D f(b, a) 1 f(6, 2. (a f(a, b) if b > a >…

A: Answer is given below .

Q: Write a recursive function called that takes a string of single names separated by spaces and prints…

A: Note : As the language is not given, the below code is in python language. for(int i=0;…

Q: Write a recursive function that takes as a parameter a nonnegative integer and generates the…

A: Programming language is missing in the question. So we will answer this program in C language. If…

Q: complete the identified statement such that the recursive function funx(n+1) = n*funx(n-1), any…

A: float funx(int n) { if(n==1) return 1; else return n*funx(n-1);…

Q: Fibonacci numbers are a sequence of integers, starting with 1, where the value of each number is the…

A: Program plan: With RECURSION Prompt for a number Pass this number to function Fibonacci. Check if…

Q: Write a recursive function named multiply that takes two positive integers as parameters and returns…

A: def multiply(a, b): if b == 0: return 0 if b == 1: return a return a +…

Q: Write a recursive function in c++that receives an integer consisting of any number of digits. Your…

A: Please find the answer below :

Q: complete the identified statement such that the recursive function funx(n+1) = n*funx(n-1), any…

A: Define header file <iostream> for io operations. Define function funx with parameter n. Use if…

Q: The sequence {an} is defined recursively by the equation: п(п — 1)а, — (n - 1)(n — 2)а,- - (п —…

A: PROGRAM INTRODUCTION: Include the required header files. Start the definition of the main function.…

Q: our main task is to write a recursive function sierpinski() that plots a Sierpinski triangle of…

A: Given: Sierpinski.java // Height of an equilateral triangle with the specified side length.…

Q: Write a recursive function that returns both the smallest and the largest element in an int array.…

A: The below given C++ program will obey the following rubrics: Including header files. In the main…

Q: Write a recursive function that finds and returns the sum of the elements of an int array. Also,…

A: Program code: //include the required header files #include <iostream> using namespace std;…

Q: Write a programe in PYTHON to Write a recursive function that takes positive int n as its input and…

A: Program Approach: Defining method sum_squares Using if the method to check n is equal to 0 Defining…

Q: Write a recursive function that receives an integer consisting of any number of digits. Your…

A: Write a recursive function that receives an integer consisting of any number of digits. Your…

Q: Write a recursive function that find the minimum element in an array of integers. int findMin(int…

A: Actually, recursion is a the function calling itself.

Q: Write a recursive function called that takes a string of single names separated by spaces and prints…

A: The python program generates the combination or permutation of a word from the user input sentence.…

Q: Write an iterative and recursive function that returns the sum of all the integers from O to a given…

A: def sum_till_n_rec(num): # if num reached 0 if num == 0: return 0 # otherwise return num +…

Q: 2. Write a recursive function printNum()that prints any given number by putting spaces between…

A: I give the code in C along with output and code screenshot

Q: For function sumtok, write the missing recursive call. This function returns the sum of the values…

A: Correct Code:- public int sumtok(int k) { if (k<= 0){ return 0; }else{ return k +…

Q: Write a recursive function called numbers that receives a single integer value and will print the…

A: According to the Question Below the Complete Program: Program Output:

Q: What does the following recursive function do? int f(int n){ if (n==1) return 1; else retum…

A: Required:

Q: Write and test a recursive function called sum_of_digits(number) that takes a positive number as…

A: Please indent the code as shown in the image below :

Q: Write a recursive function that takes as a parameter a nonnegative integer and generates the…

A: ## As no language is mentioned, we write the code in Python language. def pattern(n):…

Q: 5. Given an integer n, you need to find the digital root of that integer using a recursive function.…

A: Task : The task is to define the recursive function digital_root(n). The function returns the sum…

Q: Write a recursive function called print_num_pattern() to output the following number pattern. Given…

Q: Define a Recursive function that will compute the factorial of N. The factorial of N is define as…

A: Step-1: Start Step-2: Declare variables N and fact Step-3: Take input from user and store in N…

Q: language: Python Problem: Write a recursive function reverse(sentence) for reversing a…

A: Recursive function is a function that calls itself repeatedly until condition will be false Here…

Q: Write a recursive function that returns all the factors of (i.e. numbers that divide evenly into) a…

A: The idea is to create a function that takes 2 arguments. The function is recursively called from 1…

Q: In program C Write a recursive function find_sum(n)that calculates the sum of successive integers…

A: int find_sum(int n) { if(n == 1) return 1; else return (n + find_sum(n-1));}

Concept explainers

Computational Systems

The computation systems can be defined as the systems that are capable of solving a problem that includes calculations either mathematical or logical, and are able to produce the result as an output. For example, a simple calculator that is given a set of numbers and operators as input and produces the result as an output can be defined as a computational system. The above example is a simple illustration only, the computational systems range from simple devices to complex devices such as the systems that control the SpaceX companies, Starlink satellites which are being quite recently seen in the skies at many places globally.

Question

Write a recursive function named largestDigit that accepts an integer parameter
and returns the largest digit value that appears in that integer. Your function should
work for both positive and negative numbers. If a number contains only a single digit,
that digit's value is by definition the largest.
You must not use any loops; you also cannot use the string type or any library
functions. Your function must be recursive.
Complete the following file:
largestDigit.cpp
2 // You may use this helper function
3 int max(int a, int b) { return a < b ? b : a; }
4
5 int largestDigit(int n)
if((n<0) && (n/10
if(n<0) n =
0)) return n;
8
-n;
static int maxi
9
n%10;
0) return maxi;
maxi = max(maxi, n%10);
return largestDigit(n/10);
=
10
if((n/10)
11
12
13
14
15
16 }
Submit
Calling with Arguments
Name
Arguments Actual Expected
pass largestDigit 135725
7
7
pass largestDigit 111211
2
2
fail
largestDigit 100000
1
pass largestDigit 4530021
5
pass largestDigit 7639852
fail
largestDigit 76352
6
pass largestDigit 666555444
6
6
pass largestDigit 12424224
4
pass largestDigit 1242526
6
pass largestDigit o
670O

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

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

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

Given two integers x snf y, the following recurrsive definition determined the greatest common divisor of x and y, Write gcd(xy). Write a recursive function, gcd, that takes two integers as parameters and returns the greatest commmon divisorof numbers.Also write a program to test your function. Write a recursive function,reverseDigits, that takes an integer as a parameter snd returns the number with the digits reversed. Also write a program to test your application.
Write a function that takes in an integer n and computes n!. Do this without recursion. In [ ]: deffactorial_iter(n):"""Takes in an integer n>0 and returns the product of all integers from 1 to n."""# YOUR CODE HEREraiseNotImplementedError() In [ ]: In [ ]: assert factorial_iter(6) == 720 assert factorial_iter(7) == 5040 assert factorial_iter(10) == 3628800
The goal is to rewrite the function, below, such that passes in a different list of parameters, particularly eliminating the need to pass low and high for each recursive call to binary_search. defbinary_search(nums,low,high,item): mid=(low+high)//2iflow>high:returnFalse #The item doesn't exist in the list!elifnums[mid]==item:returnTrue# The item exists in the list!elifitem<nums[mid]:returnbinary_search(nums,low,mid-1,item)else:returnbinary_search(nums,mid+1,high,item) The new function should be prototyped below. The number of changes between the given version, and the one requested is not significant. defbinary_search(nums,item):pass# Remove this and fill in with your code Tip: If you consider that high and low are used to create a smaller version of our problem to be processed recursively, the version requested will do the same thing, just through a different, more Pythonic technique.
Java, I am not displaying my results correct. It should add up the digits in the string. input string |result for the sumIt Recursion functions and a findMax function that finds the largest number in a string "1d2d3d" | 6 total "55" |10 total "xx" | 0 total "12x8" |12 Max number "012x88" |88 Max Number "012x88ttttt9xe33ppp100" |100 Max Number public class Finder { //Write two recursive functions, both of which will parse any length string that consists of digits and numbers. Both functions //should be…
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.
Python only** Use recursive function* Define countBetween with 2 parameters Use def to define countBetween with 2 parameters thas two parameters: a starting number and an ending number, and counts up (i.e., prints consecutive integers) from the starting number to the ending number. If the numbers are the same, it just prints that number; if the ending number is lower than the starting number, it prints nothing. Do not use any kind of loop Within the definition of countBetween with 2 parameters, do not use any kind of loop. Call countBetween Within the definition of countBetween with 2 parameters, call countBetween in at least one place. Python only** Use recursive function* Define countThereAndBack with 2 parameters Use def to define countThereAndBack with 2 parameters after reaching the ending number, it also counts back down to the starting number. It accepts the same two parameters defining starting and ending numbers it should print nothing if the starting number is…
1.The following is the C code that you need to implement for this lab: uint8_ t f(uint8_tn) return(n<2)?(n):(f(n-1)+f(n-2)); The main function can be assumed as follows: int main() uint8_ t x; x=f(???); return 0; Obviously, " ? ? ? " is representing a value used to test the algorithm! Is "f"recursive? a.No answer text provided. b.Yes c.no d.depends on whether it is in for main 2.First, make the code in the previous question an actual C program so that it can be compiled and it runs. Play with it so that you feel comfortable with the logic of the code. Then implement the code in TTPASM. Note that you need to preserve the actual C code structure, this means you cannot it into a non-recursive subroutine. Furthermoreall conventions discussed in class regarding subroutines must be followed. The idea is that I should be able to substitute f with my own code, and main should work. Or, I can substitute main with my own, and f should work. Attach the source code of your assembly…
In Python implement a recursive function named test() that accepts an integer parameter. If the parameter value is even then the test function should divide the parameter value by 2 and return this value. If the parameter value is odd, then the function should return 3 times the parameter value + 1. Then request a user to enter an integer number and recursively call converge() on that number until the function returns the value 1.
need help Writing a recursive function, isPalindrome, to check if a string is a palindrome. Return true if the string is a palindrome; otherwise, return false. in javascript example isPalindrome('Kayak'); // => true i sPalindrome('NEVERODDOREVEN'); // => true i sPalindrome('Tacocat'); // => true isPalindrome('SELFLESS'); // => false
Write a recursive function named sumSquares that returns the sum of the squares of the numbers from 0 to num, in which num is a nonnegative int variable. Do not use global variables; use the appropriate parameters. Also write a program to test your function.
Write a recursive function, reverseDigits, that takes an integer as a parameter and returns the number with the digits reversed. Also, write a program to test your function.
We rite a recursive function that calculates the products of natural numbers (1 through n) as follows: - asks the user to enter a positive number n - calculates and prints out the product of 1 through n (for example for n=5 the product is 120) Uploads: .c code and the output