-
Notifications
You must be signed in to change notification settings - Fork 6
Recursion
tim-hardcastle edited this page Aug 1, 2024
·
5 revisions
The for loops and piping operators in Pipefish should keep you from having to use recursion unless it is really necessary. But when you do want to, you can. The file examples/recursion.pf contains a recursive factorial function and a recursive Fibonacci function:
def
factorial (n int) :
n == 0 :
1
else n * factorial n - 1
fib(n) :
n == 1 or n == 2 :
1
else :
fib(n - 1) + fib(n - 2)
🧿 Pipefish is distributed under the MIT license. Please steal my code and ideas.
- Getting started
- Language basics
- The type system and built-in functions
- Functional Pipefish
- Encapsulation
- Imperative Pipefish
-
Imports and libraries
- The files library
- The fmt library
- The html library
- The math library
- The math/big library
- The math/cmplx library
- The math/rand library
- The path library
- The path/filepath library
- The reflect library
- The regexp library
- The sql library
- The strings library
- The terminal library
- The time library
- The unicode library
- Advanced Pipefish
- Developing in Pipefish
- Deployment
- Appendices