Write a function named second-largest in Scheme that takes a list of numbers and uses fold (or reduce) to return the second largest element on the list. You must use either fold or reduce to do the vast majority of the work. (You may do a little pre- and post- processing outside the call to fold.) You may use the built-in fold method by adding the line (require 'list-lib), or you can use your own implementation. The built-in fold function has parameters in this order: action partial-result lst. You may assume that the list contains at least one element. For example, (second-largest '(5)) should return 5 (second-largest '(1 3)) should return 1 (second-largest '(8 6 7 5 3 0 9)) should return 8

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

Write a function named second-largest in Scheme that takes a list of numbers and uses fold (or reduce) to return the second largest element on the list.

You must use either fold or reduce to do the vast majority of the work. (You may do a little pre- and post- processing outside the call to fold.) You may use the built-in fold method by adding the line (require 'list-lib), or you can use your own implementation.

The built-in fold function has parameters in this order: action partial-result lst.

You may assume that the list contains at least one element.

For example,

  • (second-largest '(5)) should return 5
  • (second-largest '(1 3)) should return 1
  • (second-largest '(8 6 7 5 3 0 9)) should return 8
 

 

Write a function named second-largest in Scheme that takes a list of numbers and uses fold (or reduce) to
return the second largest element on the list.
You must use either fold or reduce to do the vast majority of the work. (You may do a little pre- and post-
processing outside the call to fold.) You may use the built-in fold method by adding the line (require
'list-lib), or you can use your own implementation.
The built-in fold function has parameters in this order: action partial-result lst.
You may assume that the list contains at least one element.
For example,
(second-largest '(5)) should return 5
(second-largest
• (second-largest
'(1 3)) should return 1
(8 6 7 5 3 0 9)) should return 8
Transcribed Image Text:Write a function named second-largest in Scheme that takes a list of numbers and uses fold (or reduce) to return the second largest element on the list. You must use either fold or reduce to do the vast majority of the work. (You may do a little pre- and post- processing outside the call to fold.) You may use the built-in fold method by adding the line (require 'list-lib), or you can use your own implementation. The built-in fold function has parameters in this order: action partial-result lst. You may assume that the list contains at least one element. For example, (second-largest '(5)) should return 5 (second-largest • (second-largest '(1 3)) should return 1 (8 6 7 5 3 0 9)) should return 8
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Computational Systems
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
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