drummyfish/less_retarded_wiki
5
1
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Update

Browse source
This commit is contained in:
Miloslav Ciz 2024-11-22 17:05:15 +01:00
parent 481775ca4b
commit 5e0ba22bba
10 changed files with 1877 additions and 1871 deletions
Download patch file Download diff file Expand all files Collapse all files

2
algorithm.md
View file

@ -31,7 +31,7 @@ Let's write a simple algorithm that counts the number of divisors of given numbe
5. Write out the *divisor counter*.
6. If *divisor counter* is equal to 2, write out the number is a prime.
Notice that *x*, *divisor counter* and *currently checked number* are [variables](variable.md). Step 4 is a loop (iteration) and steps *a* and 6 are branches (selection). The flowchart of this algorithm is:
Notice that *x*, *divisor counter* and *currently checked number* are [variables](variable.md). Step 4 is a loop (iteration) and steps *a* and 6 are branches (selection). The [flowchart](flowchart.md) of this algorithm is:
```
START