Write a function named merge in Scheme that takes two sorted lists as input and returns a single, new sorted list. For example, (merge (13) '(2 4)) should return '(1 2 3 4) (merge '(1 3) '()) should return '(1 3)

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 18PE
icon
Related questions
Question

Merge' in Scheme

 

Write a function named merge Scheme that takes two sorted lists as input and returns a single, new
sorted list.
For example,
• (merge '(1 3) '(2 4)) should return '(1 2 3 4)
• (merge '(1 3) '()) should return '(1 3)
Transcribed Image Text:Write a function named merge Scheme that takes two sorted lists as input and returns a single, new sorted list. For example, • (merge '(1 3) '(2 4)) should return '(1 2 3 4) • (merge '(1 3) '()) should return '(1 3)
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Structure
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
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning