Nearest smaller element def nearest_smaller(items): Given a list of integer items, create and return a new list of the same length but where each element has been replaced with the nearest element in the original list whose value is smaller. If no smaller elements exist because that element is the minimum of the original list, the element in the result list should remain as that same minimum element. If there exist smaller elements equidistant in both directions, you must resolve this by using the smaller of these two elements. This again makes the expected results unique for every possible value of itema, which is necessary for the automated testing framework to work at all. Being permissive in what you accept while being restrictive in what you emit is a pretty good principle to

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
icon
Related questions
Question
Nearest smaller element
def nearest_smaller(items):
Given a list of integer itema, create and return a new list of the same length but where each
element has been replaced with the nearest element in the original list whose value is smaller. If no
smaller elements exist because that element is the minimum of the original list, the element in the
result list should remain as that same minimum element.
If there exist smaller elements equidistant in both directions, you must resolve this by using the
smaller of these two elements. This again makes the expected results unique for every possible
value of items, which is necessary for the automated testing framework to work at all. Being
permissive in what yvou accept while being restrictive in what you emit is a pretty good principle to
follow in all walks of life, not just in programming.
Expected result
items
[42, 42, 421
[42, 42, 42]
[42, 1, 17]
(1, 1, 1]
[42, 17, 1]
[17, 1, 1]
[6, 9, 3, 2]
[3, 3, 2, 2]
[5, 2, 10, 1, 13, 15, 14, 5,
11, 19, 22]
[2, 1, 1, 1, 1, 13, 5, 1, 5,
11, 19]
[1, 3, 5, 7, 9, 11, 10, 8, 6,
4, 2]
[1, 1, 3, 5, 7, 9, 8, 6, 4, 2,
1]
Transcribed Image Text:Nearest smaller element def nearest_smaller(items): Given a list of integer itema, create and return a new list of the same length but where each element has been replaced with the nearest element in the original list whose value is smaller. If no smaller elements exist because that element is the minimum of the original list, the element in the result list should remain as that same minimum element. If there exist smaller elements equidistant in both directions, you must resolve this by using the smaller of these two elements. This again makes the expected results unique for every possible value of items, which is necessary for the automated testing framework to work at all. Being permissive in what yvou accept while being restrictive in what you emit is a pretty good principle to follow in all walks of life, not just in programming. Expected result items [42, 42, 421 [42, 42, 42] [42, 1, 17] (1, 1, 1] [42, 17, 1] [17, 1, 1] [6, 9, 3, 2] [3, 3, 2, 2] [5, 2, 10, 1, 13, 15, 14, 5, 11, 19, 22] [2, 1, 1, 1, 1, 13, 5, 1, 5, 11, 19] [1, 3, 5, 7, 9, 11, 10, 8, 6, 4, 2] [1, 1, 3, 5, 7, 9, 8, 6, 4, 2, 1]
Expert Solution
steps

Step by step

Solved in 8 steps with 7 images

Blurred answer
Knowledge Booster
Map
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
  • SEE MORE QUESTIONS
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