scheme2_worksheet

scheme2_worksheet - CSCC24 Principles of Programming...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSCC24 – Principles of Programming Languages Functional Programming - Scheme Defining Functions From last class: Parameter: integer n ≥ 0. Result: sum of integers from 0 to n. ( define (sum-n n) (cond ) ) What could/should we change if ____________? (sum-list x): Given x a list of numbers, returns the sum of all the numbers in x. ( define (sum-list x) (cond How would you define sum-n if n could be a list of s-expressions and you only wanted to sum those elements that are numbers? Recursive Scheme Function: Length (Note: There is a built-in length function. ) ( define (length x) (cond ) ) This is called “cdr-recursion” which processes the car of the list and then has a recursive call on the cdr of the list. More cdr recursion (append x y): 1) We recurse through the first list, taking it apart and adding it onto the second list. _____________________________________ _____. Let's show some examples of this: (append '(a) '(b c)) (append '(a b c) '(d (e f) g)) There are two bases cases.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

scheme2_worksheet - CSCC24 Principles of Programming...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online