#functions
Read more stories on Hashnode
Articles with this tag
To finish our glorious Fibonacci/Binary Tree Series, let's solve the second task of the Euler Project. Task description Each new term in the...
Welcome back to our "Binary Tree" week! Today we will discuss the enum function. It can be used to emulate arrays (as you might have noticed, PicoLisp...
In the previous posts, we discussed the theory of binary trees. Now we will look at at two actually useful implementations of binary trees: the cache...
Today we will discuss an interesting function called fifo: First-In-First-Out. As always in "PicoLisp Explored", we will check the documentation and...
There are things known and things unknown and in between are the DOORS … (Jim Morrison) · Today we will talk about the 100 Doors task of the Rosetta Code...
Welcome back! This is the last post of the 60 most common PicoLisp functions series. Today we will cover lists and strings. We will handle the topic...