We present a collection of examples of NiMo programs, with animation of their (step by step or continue) execution (shown only a few steps!).
Results flow from right to left of the screen.

The Fibonacci example produces an "infinite" sequence of integers as a result . Golden's example makes the calculation of the golden ratio approximated by the quotient of consecutive pairs of elements in the Fibonacci sequence. The result of the execution is a real number: the golden ratio.
It also shows the use of user-defined components (FIBO) and the implementation of programs that use them. Execution is visualized without expansion of the component.
The third example shows the transformation of a finite entry sequence into an ordered one by using the quick-sort algorithm; a case of recursive definition.

Program examples
Fibonacci Fibonacci sequence	Golden Divine section	Quicksort Sorting using a recursive solution

Note: More about Golden Ratio

Basic proceses examples
Filter The process removes all input elements that do not satisfy the condition	Takewhile The process returns the maximum prefix of the input, whose elements verify the condition	Last Returns the last element of the input list
>, <, >=, <= Relational operators	Apply Apply process	Head-Tail Separates the entry into the first element and the rest