Lists and recursion
Lists are linked structures processed with pattern matching and higher-order functions.
What you will be able to do
- Use map, filter and foldr.
- Match [] and (x:xs).
- Prefer library functions to manual recursion.
In plain English
Lists are linked structures processed with pattern matching and higher-order functions.
- Use map, filter and foldr.
- Match [] and (x:xs).
- Prefer library functions to manual recursion.
doubleAll :: [Int] -> [Int]
doubleAll = map (* 2)
total :: [Int] -> Int
total = sumYour turn
EasyExplain it back
Answer from memory: Which function transforms every list element?
TEXT · starter
Your answer…Check your understanding before moving on.
Knowledge checkQuestion 1
Which function transforms every list element?
Select an answer to continue
Study tools
Make it yours.
Keep a private note for this lesson, then turn the key ideas into flashcards you can revisit.
Sign in to save notes and flashcards.Both are private to your account and stay with your progress.
Sign inFinished reading?
Lock in what you just learned.
0%
Mark this lesson complete to save your place and move one step closer to the certificate.