Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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.

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.

Database System Concepts
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
icon
Related questions
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.
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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Linked List Representation
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS