Write a procedure, called count-to-1, that takes a positive integer n, and returns a list of the integers counting down from n to 1. For example, given input 3, it will return (list 3 2 1). Hint: Use the procedures reverse and count-to-n that you wrote in the previous problems. (Shown in attached image)
Write a procedure, called count-to-1, that takes a positive integer n, and returns a list of the integers counting down from n to 1. For example, given input 3, it will return (list 3 2 1). Hint: Use the procedures reverse and count-to-n that you wrote in the previous problems. (Shown in attached image)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Using Clojure
Write a procedure, called count-to-1, that takes a positive integer n, and returns a list of the integers counting down from n to 1. For example, given input 3, it will return (list 3 2 1).
Hint: Use the procedures reverse and count-to-n that you wrote in the previous problems. (Shown in attached image)
![; Problem 9
; Write a procedure, called reverse, that takes in a list, and returns the reverse of the list.
(defn rev [1 & result]
(if (seq 1)
(recur (rest 1)
(cons (first 1)result))result))
; Problem 10
; Write a procedure, called count-to-n, that takes a positive integer n, and returns a list of the integers counting up from 1 to n
(defn count-to-n [n]
(loop [i 1]
(when (<= i n)
(println i)
(recur (inc i));
)))
(count-to-n 10)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3200e892-7b83-4670-8aa5-c4c84f2a6adb%2Fec9bf27d-f379-45b0-9175-e4615331fc19%2Ffdqnvzo_processed.png&w=3840&q=75)
Transcribed Image Text:; Problem 9
; Write a procedure, called reverse, that takes in a list, and returns the reverse of the list.
(defn rev [1 & result]
(if (seq 1)
(recur (rest 1)
(cons (first 1)result))result))
; Problem 10
; Write a procedure, called count-to-n, that takes a positive integer n, and returns a list of the integers counting up from 1 to n
(defn count-to-n [n]
(loop [i 1]
(when (<= i n)
(println i)
(recur (inc i));
)))
(count-to-n 10)
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 now
This is a popular solution!
Step by step
Solved in 5 steps with 3 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY