Karteikarten
4.12 Definitions
Karten in diesem Stapel (12)
- 1functional programmingrelies on passing functions around between other functions
- 2recursionfunctions being passed to themselves
- 34 things first class objects must doappear in expressions
be assigned to a variable
be assigned as arguments
be returned in function calls. - 4higher-order functionfunctions that use other functions as parameters or return a function
- 5Base casethis stops the program from repeating forever and crashing
- 6recursive casethe part where the function calls itself
- 7f: A->Bf is the function name
A is the domain it is the set of all the possible inputs
B is the co-domain meaning the set of all possible outputs - 8set comprehensionhow we define our own set
{z | z∈ℝ and z>0} - 9combinedx ○ y
you do this combination starting with y - 10A listis a resizable data structure
- 11head of the listthe first value
- 12tail of the listall of the other values in the list but not the head
Informationen
- Beschreibung
- A level Computing Karteikarten am 4.12 Definitions, erstellt von Rose Wakeford am 11/06/2026.
- Erstellt von
- Rose Wakeford
- Aufrufe
- 0
- Bewertung