
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
Python. Please solve quickly!!
![Function Description
Generate the code for a recursive function: furthest (n:
int, lst: list)--> int
The function returns the difference between the target
value n and the element in the list that is furthest in
value from the target n.
(ie. return the distance on
a
number line between the target and the list element
that is furthest away.)
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:
17
print (furthest (5, [1, 3, 6, 9, 22]))
print (furthest (12, [15, 9, 16, 3, 1]))
print (furthest (5, [-5, 36, 12, 27, 6, -14, 19, 27, 34]))
print (furthest (5, [15, 61, 21, 12, 4, -25, 5, -55, 51]))
print (furthest (-10, [-5, -61, -21, -17, 16]))
11
31
60
51
Explanation:
• In the first example, 17 is the difference between
target 5 and the value in the list that is
furthest away, 22.
Restrictions:
• The built-in min(), max() and sorted () functions
may not be used.
• The list sort() method may not by used.
• The result must be determined recursively.](https://content.bartleby.com/qna-images/question/70a6ad28-c20f-4c7b-ae3b-f34c9fc80226/9d29fbef-d43c-4b04-b286-9d30181589ad/0b726ml_thumbnail.jpeg)
Transcribed Image Text:Function Description
Generate the code for a recursive function: furthest (n:
int, lst: list)--> int
The function returns the difference between the target
value n and the element in the list that is furthest in
value from the target n.
(ie. return the distance on
a
number line between the target and the list element
that is furthest away.)
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:
17
print (furthest (5, [1, 3, 6, 9, 22]))
print (furthest (12, [15, 9, 16, 3, 1]))
print (furthest (5, [-5, 36, 12, 27, 6, -14, 19, 27, 34]))
print (furthest (5, [15, 61, 21, 12, 4, -25, 5, -55, 51]))
print (furthest (-10, [-5, -61, -21, -17, 16]))
11
31
60
51
Explanation:
• In the first example, 17 is the difference between
target 5 and the value in the list that is
furthest away, 22.
Restrictions:
• The built-in min(), max() and sorted () functions
may not be used.
• The list sort() method may not by used.
• The result must be determined recursively.
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
Trending nowThis is a popular solution!
Step by stepSolved in 4 steps with 2 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.Similar questions
- Please construct a 2048 game in java by object-oriented programming! readymade code is perfect!arrow_forwardThere are probably many reasons why PYTHON has become so popular as a cloud computing platform.arrow_forwardWhy is python a popular cryptocurrency for cloud computing? How can you use python's benefits to demonstrate why it was chosen for cloud computing over other programming languages? Microsoft created the open-source programming language called Python.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

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