#recursive functions

Pandyland with the best (only?) joke on recursive functions ever.

In this post let’s see what is recursion!

When any function calls itself, the function is called recursive function and the process is called recursion. Recursion makes the program look more elegant and cleaner, and since all algorithms can be defined recursively, and this makes it easier to visualize and prove.

But also if the program is concerned with execution time, try avoiding it because…

One time I was writing a recursive path-finding function. My first attempt was a royal mess so I started over and made a much more neat and comprehensible set of functions. Except that it still didn't work. It sometimes spit out correct answers and other times spit out the tag for no solution where there clearly was one.

JOHN SINDELAR of Seedcode shows how Javascript can really extend FileMaker’s capabilities and speed things up at the same time, both with UI tools and a library of other tools to work with code:

JavaScript Functions in FileMaker are Fast

Looping through 49,000 characters took our tail-recursive custom function almost 3 seconds.

The JavaScript version of the function looped through 10 times that…

So we wrote stories, distilled them to 10 words, then drew pictures, then used the pictures to inspire new stories. (Here are the details of the exercise.) And the above GIF shows the final drawings and 10-word distillations we made that night.