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.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: fun {GaussSum N} if N=1 then 1 else N+{GaussSum N-1} end end

A: In this question we have to write a code in OZ programming language for the gauss sum of a n natural…

Q: create a function named powerHalf(x, n), where this function is recursive like power(x, n), but it…

A: - We need to highlight the code for the power function as provided in python.

Q: Consider the following function shoots: def shoots(x: int) -> int: 2 if x <= 0: 3\ return 0 4 elif x…

A: We are given a recursive function and we are given few statements for it, we need to pick the…

Q: Write a recursive function that takes a positive integer n as input. The function outputs the sum of…

A: Given:

Q: backward. That is,, if the argument is 1234, it outputs the following to the screen: 4321.

A: #include <iostream> using namespace std; void reverse(int n) //function reverse{ if (n…

Q: n kotlin, Write two versions of the recursive summation function (that is, take an int parameter n…

A: Hеrе is a high-lеvеl algorithm for thе rеcursivе summation function in Kotlin:Chеck if thе input…

Q: write a recursive version. The function takes two string parameters, s1 and s2 and returns the…

A: #include <iostream>using namespace std; //Recursive Function to see if the string and…

Q: In Kotlin, Write a higher-order function that takes two arguments and returns a String. The first…

A: The task is to create a Kotlin program that includes a special function. This function takes two…

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: Write a function reverse () that inputs a number and returns the reverse of that number, for example…

A: As the programming language is not provided in the question . As per our policy we are solving the…

Q: text = "ALICE was beginning to get very tired of sitting by her sister on the bank, and of having…

A: The task specified in the question is to write a R program to write a function that predicts a set…

Q: For problem A you will be writing two different functions to iterate through a string. One function…

A: The Python code is given below with output screenshot

Q: Write code to complete raise_to_power(). Note: This example is for practicing recursion; a…

A: Given,Write code to complete raise_to_power(). Note: This example is for practicing recursion; a…

Q: QUESTIONG Create NON-RECURSIVE Python function that will accept an integer parameter and print…

A: Option 1 is wrong as the function is including welcome as parameter and prints only one time as if…

Q: A pandigital number contains all digits (0-9) at least once. Write a function that takes an integer,…

A: Algorithm - Take input from the user. Now use the below logic - return new…

Q: We define the following recursive Python function: def cool(n): if n==0: return 2 if n==1: return 1…

A: Given To do the python program using dynamic programming. def cool(n): if n==0: return 2…

Q: Write the definition of a recursive function named starsCount that takes a string parameter and…

A: According to the Question below the solution: Output:

Q: Consider the Python code for finding the factorial of an integer n using recursion. Line numbers…

A: The line of code that includes a recursive function call in the provided Python code for finding the…

Q: In Kotlin, Write and test a recursive function called harm with an expression body that takes an Int…

A: Check if the number is equal to 1.If yes, then we have to return 1.If no, then we have to continue…

Q: Writing a recursive function, isPalindrome, to check if a string is a palindrome. Return true if…

A: Given: We have to write javascript code using recursive function, isPalindrome, to check if a…

Q: Please help me with these question. I am having trouble understanding what to do. Please use HTML,…

A: Counting Asterisks RecursivelyThis prompt requires us to devise a function that counts the number of…

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

Write a program named stars.py that has two functions for generating star polygons. One function should be implemented using an iteration (a for loop), and another function should be a recursion. It is optional to fill in your shapes. The functions for generating stars should be named star (size, n, d=2) and star_recursive (size, n, level, d=2), where size is the size of the polygon side (edge), n is the number of sides (or angles), d is a density or winding number that should be set to default value 2, and level is the level of recursion initially equal to n.
Write a program called p3.py that contains a function called reveal_recursive() that takes a word (string) and the length of the word (int) as input and has the following functionality: 1. prints the word where all characters are replaced by underscores 2. continue to print the word revealing one character at a time. i.e., the second line printed should print the first character followed by “_”’s representing the rest of the word. (see example below) 3. the function should end after printing the entire word once. 4. This function should be recursive Example: #the word is kangaroo ________ k_______ ka______ kan_____ kang____ kanga___ kangar__ kangaro_ kangaroo
Please only do rec_sum_digits function in python using only recursive and no loop
Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"
Python: How do I create a recursive function asterisk with both recursive and base cases? so for n=3, you would have below; *** ** * code that I have: for i in range(n): print("*",end="")
-Python- Write a function get_letter_grade, such that when given * a lab grade score and * a list of the grade cutoffsreturns the letter grade of that score.Note: Your function automatically returns A for the values that are >= to the first cutoff-value in the list, then A- for the second cutoff-value, B+ for the third and so on. The function returns None for anything that's below the score for B-. You test that get_letter_grade(97, [93, 90, 87, 83, 80]) correctly returns an A, and get_letter_grade(93, [97, 90, 87, 83, 80]) returns A-. DO NOT hard-code the cutoffs, since they can change! You can copy/paste the following template: def get_letter_grade(score, cutoffs): if score ... : return 'A' ...: return 'A-' ...: return 'B+' ...: return 'B' ...: return 'B-'
Write code to complete raise_to_power(). Note: This example is for practicing recursion; a non-recursive function, or using the built-in function math.pow(), would be more common.Sample output with inputs: 4 24^2 = 16 def raise_to_power(base_val, exponent_val): if exponent_val == 0: result_val = 1 else: result_val = base_val * ''' Your solution goes here ''' return result_val user_base = int(input())user_exponent = int(input()) print('{}^{} = {}'.format(user_base, user_exponent, raise_to_power(user_base, user_exponent)))
Computer scientists and mathematicians often use numbering systems other than base 10. Write a program that allows a user to enter a number and a base and then prints out the digits of the number in the new base. Use a recursive function baseConversion (num, base) to print the digits. Hint: Consider base 10. To get the rightmost digit of a base 10 number, simply look at the remainder after dividing by 10. For example, 153 % 10 is 3. To get the remaining digits, you repeat the process on 15, which is just 153 // 10. This same process works for any base. The only problem is that we get the digits in reverse order (right to left). The base case for the recursion occurs when num is less than base and the output is simply num. In the general case, the function (recursively) prints the digits of num // base and then prints num % base. You should put a space between successive outputs, since bases greater than 10 will print out with multi-character "digits." For example, baseConversion(1234,…
Need help Writing a function, countVowels, that accepts a string as an argument. countVowels should return the number of vowels in that string. Use recursion. example countVowels('Four score and seven years'); // => 9
Write code to complete raise_to_power(). Note: This example is for practicing recursion; a non-recursive function, or using the built-in function math.pow(), would be more common.Sample output with inputs: 4 24^2 = 16 def raise_to_power(base_val, exponent_val): if exponent_val == 0: result_val = 1 else: result_val = base_val * Your solution goes here return result_val user_base = int(input())user_exponent = int(input()) print('%d^%d = %d' % (user_base, user_exponent, raise_to_power(user_base, user_exponent)))