finalized examples

docs/03-supported-syntax.md

@@ -25,7 +25,7 @@ A process can contain any number of words and symbols, but it must contain at le
 
 From Wikipedia's article on Nassi–Shneiderman diagram:
 
-> "The loop allows the program to loop one or a set of processes until a particular condition is fulfilled.
+> "The loop allows the program to loop one or a set of processes until a particular condition is fulfilled."
 
 The project supports two types of loops: test-first loops and test-last loops, each differing in the sequence of executed steps.
 

docs/04-examples.md

@@ -5,48 +5,118 @@ It is not a tutorial on how to use the project, but rather a showcase of what th
 
 ## Variable assignment
 
+> Variable assignment is a fundamental concept that involves giving a name to a piece of data.
+> It allows for storage and manipulation of information within a computer program.
+
+When a value is assigned to a variable, it is akin to instructing the system, "Remember this information by this name."
+It's like storing a number, a word, or any other data type under a chosen label.
+The label can then be utilized in the code to perform operations, make decisions, or simply reference that piece of data.
+
 Textual description:
 
 <iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=Set+%22var%22+to+%221%22%3B"></iframe>
 
-The [Pseudocode](https://en.wikipedia.org/wiki/Pseudocode#Common_mathematical_symbols) style variable assignment:
+[Pseudocode](https://en.wikipedia.org/wiki/Pseudocode#Common_mathematical_symbols) style using ":=" symbol:
 
 <iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=var+%3A%3D+1%3B"></iframe>
 
+[Pseudocode](https://en.wikipedia.org/wiki/Pseudocode#Common_mathematical_symbols) style using "<-" symbol:
+
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=var+%3C-+1%3B"></iframe>
+
 ## Type annotation
 
+> Type annotation is the practice of explicitly specifying the data type of a variable.
+> This helps in defining the kind of information that a variable can hold, promoting code clarity and preventing potential errors.
+
+When annotating the type of a variable, additional information is provided to both programmers and the compiler or interpreter.
+It is similar to informing the system that a variable is meant to store numbers, text, or some other specific data type.
+
 Textual description:
 
 <iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=Set+%22var%22+of+type+%22Integer%22+to+%221%22%3B"></iframe>
 
-The [C programming language](https://en.wikipedia.org/wiki/The_C_Programming_Language) style type declaration:
+[C programming language](https://en.wikipedia.org/wiki/The_C_Programming_Language) style:
 
-<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=Integer+var+%3A%3D+0%3B"></iframe>
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=Integer+var+%3A%3D+1%3B"></iframe>
 
-[Python](https://docs.python.org/3/library/typing.html) and [Typescript](https://www.typescriptlang.org/docs/handbook/2/everyday-types.html) type annotation:
+[Python](https://docs.python.org/3/library/typing.html) style:
 
-<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=var%3A+Integer+%3A%3D+0%3B"></iframe>
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=var%3A+Integer+%3A%3D+1%3B"></iframe>
 
 ## Loop
 
-The [Pascal](<https://en.wikipedia.org/wiki/Pascal_(programming_language)>) style loop:
+> Loops are a construct that allows a program to repeat a set of processes or operations until a particular condition is met.
+> They enhance the efficiency and flexibility of code, enabling the automation of repetitive tasks.
+
+The loop concept involves two main types, both types provide a mechanism for controlled repetition, contributing to the structured flow of a program:
+
+- **Test-First Loops**: The condition is checked before executing the processes.
+- **Test-Last Loops**: The condition is assessed after the processes have run.
 
-<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=for+%28i+%3A%3D+1+to+100%29+%7B%0A++processes%3B%0A%7D"></iframe>
+Textual Description (Test-first loop):
+
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=for+%28Repeat+until+%22condition%22%29+%7B%0A++processes%3B%0A%7D"></iframe>
+
+Pseudocode style (Test-first loop):
+
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=for+%28i+%3D+%22something%22+TO+%22something+else%22%29+%7B%0A++processes%3B%0A%7D"></iframe>
 
 ## Sequence calculation
 
-Sequence calculation is a pattern of algorithm which reduces a sequence of elements to one element.
-In the most generic form, this pattern requires an initial value as a starting point and a reducer function.
+Sequence calculation is a pattern of algorithm which reduces a sequence of elements to one element, which is archieved by repeated applying functions or operations to two elements and combining them into one.
 
-The "result" variable is the accummulator as the sequence is calculated and the "op" function is the reducer function.
+Sequence calculation on integers using addition:
 
-<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=result+%3A%3D+init%3B%0Afor+%28i+%3D+1..length%28seq%29%29+%7B%0A++result+%3A%3D+op%28result%2C+seq%5Bi%5D%29%3B%0A%7D%0A"></iframe>
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=_+Summation%28Integer%5B1..%5D+sequence%29+%7B%0A++Integer+result+%3A%3D+sequence%5B1%5D%3B%0A++for+%28i+%3D+2..length%28sequence%29%29+%7B%0A++++result+%3A%3D+result+%2B+sequence%5Bi%5D%3B%0A++%7D%0A%7D"></iframe>
 
 ## Counting
 
 Counting is a pattern of algorithm which reduces a sequence of elements to a natural number.
-The behavior is archieved through a predicate function.
+It looks at every element in a sequence and see how many of those elements have a certain property.
+
+Counting the number of primes numbers in an interval:
+
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=_+Counting%28Integer+start%2C+Integer+end%29+%7B%0A++Integer+count+%3A%3D+0%3B%0A++for+%28i+%3D+start..end%29+%7B%0A++++if+%28isPrime%28i%29%29+%7B%0A++++++count+%3A%3D+count+%2B+1%3B%0A++++%7D%0A++%7D%0A%7D"></iframe>
+
+## Maximum selection and minimum selection
+
+Maximum selection and minmium selection are a similar pattern algorithm.
+Both of them reduce a sequence of elements to one element.
+This element is either the "maximum" or the "minimum" element of the sequence.
+
+Maximum selection on integers:
+
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=_+MaximumSelection%28Integer%5B1..%5D+sequence%29+%7B%0A++Integer+result+%3A%3D+sequence%5B1%5D%3B%0A++for+%28i+%3D+2..length%28sequence%29%29+%7B%0A++++if+%28sequence%5Bi%5D+%3E+result%29+%7B%0A++++++result+%3A%3D+sequence%5Bi%5D%3B%0A++++%7D%0A++%7D%0A%7D"></iframe>
+
+Minimum selection on integers:
+
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=_+MinimumSelection%28Integer%5B1..%5D+sequence%29+%7B%0A++Integer+result+%3A%3D+sequence%5B1%5D%3B%0A++for+%28i+%3D+2..length%28sequence%29%29+%7B%0A++++if+%28sequence%5Bi%5D+%3C+result%29+%7B%0A++++++result+%3A%3D+sequence%5Bi%5D%3B%0A++++%7D%0A++%7D%0A%7D"></iframe>
+
+## Search
+
+Search is a pattern of algorithm which reduces a sequence of elements to one element.
+The element is chosen based on whether it has a certain property or not.
+However, such an element might not exist in the sequence.
+
+Searching for a prime number in a sequence of integers, defaults to "-1" when the sequence does not contain a prime number:
+
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=_+Search%28Integer%5B1..%5D+sequence%29+%7B%0A++Integer+result+%3A%3D+-1%3B%0A++for+%28i+%3D+1..length%28sequence%29%29+%7B%0A++++if+%28isPrime%28sequence%5Bi%5D%29%29+%7B%0A++++++result+%3A%3D+sequence%5Bi%5D%3B%0A++++%7D%0A++%7D%0A%7D"></iframe>
+
+## Selection
+
+Selection is a pattern of an algorithm which reduces a sequence of elements to one element.
+Unlike Search, at least one such element exists.
+
+Selecting the last prime number in a sequence of integers:
+
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=_+Select%28Integer%5B1..%5D+sequence%29+%7B%0A++Integer+result+%3A%3D+sequence%5B1%5D%3B%0A++for+%28i+%3D+2..length%28sequence%29%29+%7B%0A++++if+%28isPrime%28sequence%5Bi%5D%29%29+%7B%0A++++++result+%3A%3D+sequence%5Bi%5D%3B%0A++++%7D%0A++%7D%0A%7D"></iframe>
+
+## Decision
+
+Decision is a pattern of an algorithm which reduces a sequence of elements to a boolean value.
+If an element in a sequence satisfies a certain property, it resolves to true, and false otherwise.
 
-The "counter" variable keeps track of valid and invalid elements and the "hasAttr" function serves as the predicate.
+Decide whether a sequence of integers contains a prime number or not:
 
-<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=counter%3A+natural+%3A%3D+0%3B%0Afor+%28i+%3D+1..length%28seq%29%29+%7B%0A++if+%28hasAttr%28seq%5Bi%5D%29%29+%7B%0A++++counter+%3A%3D+counter+%2B+1%3B%0A++%7D%0A%7D%0A"></iframe>
+<iframe width="100%" style="aspect-ratio: 16/9; border:none;" loading="lazy" src="https://eurydia.github.io/project-nassi-shneiderman-diagram-builder-online/?preview=true&content=_+Decision%28Integer%5B1..%5D+sequence%29+%7B%0A++Boolean+result+%3A%3D+NO%3B%0A++for+%28i+%3D+2..length%28sequence%29%29+%7B%0A++++if+%28isPrime%28sequence%5Bi%5D%29%29+%7B%0A++++++result+%3A%3D+YES%3B%0A++++%7D%0A++%7D%0A%7D"></iframe>