Generate the code for a recursive function: closest(n: int, 1st: list)--> int The function returns the value of the element in the list that is closest in value to, but not greater than the target number n. The code should work for any list of integers with a length greater than or equal to 1. See sample test results below: Function Call: Returns: 3 closest (5, [1, 3, 6, 9, 22]) closest (15, [22, 9, 16, 3, 1]) |c1osest (5, [-5, 36, 12, 27, б, -14, 19, 27, 341) closest (5, [15, 61, 21, 12, 4, -25, 5, 51, -55]) closest (-10, [-5, -61, -21, -17, 16]) 9 -5 -17
Generate the code for a recursive function: closest(n: int, 1st: list)--> int The function returns the value of the element in the list that is closest in value to, but not greater than the target number n. The code should work for any list of integers with a length greater than or equal to 1. See sample test results below: Function Call: Returns: 3 closest (5, [1, 3, 6, 9, 22]) closest (15, [22, 9, 16, 3, 1]) |c1osest (5, [-5, 36, 12, 27, б, -14, 19, 27, 341) closest (5, [15, 61, 21, 12, 4, -25, 5, 51, -55]) closest (-10, [-5, -61, -21, -17, 16]) 9 -5 -17
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
Related questions
Question
PYTHON
![Generate the code for a recursive function: closest (n: int,
1st: list)--> int
The function returns the value of the element in the list that
is closest in value to, but not greater than the target number
n.
The code should work for any list of integers with a length
greater than or equal to 1.
See sample test results below:
Function Call:
Returns:
3
closest (5, [1, 3, 6, 9, 22])
closest (15, [22, 9, 16, 3, 11)
с1osest (5, [-5, 36, 12, 27, б, -14, 19, 27, 34])
9
-5
с1osest (5, [15, 61, 21, 12, 4, -25, 5, 51, -55])
closest (-10, [-5, -61, -21, -17, 16])
-17
Explanation
Submit
Cancel
he
kample, 3 is the closest value to 5 that is](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbb59da21-6edc-4734-a521-4b0579c272ae%2F3f7ef86d-13a2-4559-96fb-46ff61dc1da8%2Fouyepfa_processed.png&w=3840&q=75)
Transcribed Image Text:Generate the code for a recursive function: closest (n: int,
1st: list)--> int
The function returns the value of the element in the list that
is closest in value to, but not greater than the target number
n.
The code should work for any list of integers with a length
greater than or equal to 1.
See sample test results below:
Function Call:
Returns:
3
closest (5, [1, 3, 6, 9, 22])
closest (15, [22, 9, 16, 3, 11)
с1osest (5, [-5, 36, 12, 27, б, -14, 19, 27, 34])
9
-5
с1osest (5, [15, 61, 21, 12, 4, -25, 5, 51, -55])
closest (-10, [-5, -61, -21, -17, 16])
-17
Explanation
Submit
Cancel
he
kample, 3 is the closest value to 5 that is
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education