We have identified in Python some of the elements that must appear in any
powerful programming language:
- Numbers and arithmetic operations are primitive built-in data values and
functions.
- Nested function application provides a means of combining operations.
- Binding names to values provides a limited means of abstraction.
If you want to change selection, open document below and click on "Move attachment"
1.3 Defining New Functions 1.7.1 The Anatomy of Recursive Functions
1.7.2 Mutual Recursion
1.7.3 Printing in Recursive Functions
1.7.4 Tree Recursion
1.7.5 Example: Partitions
1.3 Defining New Functions
Video:
Show
Hide <span>We have identified in Python some of the elements that must appear in any
powerful programming language:
Numbers and arithmetic operations are primitive built-in data values and
functions. Nested function application provides a means of combining operations. Binding names to values provides a limited means of abstraction.
Now we will learn about function definitions, a much more powerful abstraction
technique by which a name can be bound to compound operation, which can then be
referred to as a unit.
Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details