COMPSCI 61A Lecture Notes - Lecture 10: List Comprehension, Linked List
22
COMPSCI 61A Full Course Notes
Verified Note
22 documents
Document Summary
Released at 9am on 7/11, due 10am on 7/12. A sequence has an element corresponding to any non-negative integer index less than its length, starting at 0. Links: the element in the link the next link in the list (this is a recursive definition; the rest of a linked list is another linked list) Implementations of the first and rest selectors are unnecessary. We can use functions to implement linked lists. Compute the expression for each element in the sequence, given that the conditional returns true.
