Padovan n-step number sequences: Difference between revisions
m
→Python: Functional
Line 1,005:
Aims for a legible expression of the Padovan recurrence relation, and a good level of reliability and code reuse, as well as rapid drafting and refactoring.
Functional composition, while widely practiced and written about in the context of Python, is not the dominant Python tradition. The documentation of the Python itertools module does, however,
This draft is thoroughly linted, for a high degree of compliance with Python language standards and layout.
Patterns of functional composition are constrained more by mathematical necessity than by arbitrary convention, but this still leaves room for alternative idioms of functional coding in Python. It is to be hoped that others will contribute divergent examples, enriching the opportunities for contrastive insight which Rosetta code aims to provide.
<lang python>'''Padovan N-step series'''
| |||