flâneur — a map of the web's best reading

CSC 151 - Coding Challenge 6

eikmeier.sites.grinnell.edu · 841 words · saved by 1 readers

We are providing you with starter code, CC6-template.scm. You should download this file and upload the given code to a new .scm file named reucrsion-cc.scm. You are required to document every procedure that you write using the documentation style of our course. Tests are optional, but likely helpful in determining if your code is working as desired. At the top of your file, make sure to include your name, and any acknowledgements according to our collaboration policy. Now is a great time to review those collaboration policies. Write a recursive procedure (remove-all val lst) that removes all copies of val from lst. The returned list should be in the same order as the elements appear in the original list. Write a recursive procedure (remove-duplicates lst), that takes a list as input and returns the same list, but with the duplicates removed. Elements that remain should be in the same order as their first appearance in the original list. You will likely find your procedure from part 1 h

CSC 151 - Coding Challenge 6 Coding Challenge 6: Recursion Assigned Friday, 10 October 2025 Due Friday, 17 October 2025 --> Summary In this coding challenge we solve problems using recursion. Collaboration You must work individually on this assignment. You may only consult members of the course staff for help. Instructions We are providing you with starter code, CC6-template.scm . You should download this file and upload the given code to a new . scm file named reucrsion-cc.scm . You are required to document every procedure that you write using the documentation style of our course. Tests are

Explore this link on the map →

saved by

related reading