Alg blackcurrant marmalade

the start

Crush the blackcurrant berries

Bring to a boil in a saucepan

Rub the hot mass through a sieve

Cook until done

con

Our mothers and grandmothers have many culinary recipes for baking, preserving and preparing various dishes: fresh cabbage pie, stuffed fish with fried onions, fruit salad with walnuts, beef stew with mushrooms, "anthill" cake, etc.

Pancake recipe :

Pour 200 g of flour, 2 eggs and 2 dl of milk or water into a deep bowl. Beat the dough until it becomes lump-free. In the whipped dough

add 1 dl of oil and mix. Bake pancakes in a pan,

thread them as desired and enjoy!

The given recipe for pancakes is an example of an algorithm

(admittedly, it is not mathematical and cannot be implemented on a computer).

It contains the steps that lead us to the solution of our problem (and the problem in this case is that we craved delicious pancakes). The following steps tell us how to make pancake batter:

1) Take a deep bowl.

2) Pour 200 g of flour and 2 eggs into it.

3) Pour 2 dl of milk, and if you don't have milk, pour 2 dl of water.

4) Beat until the mixture is lump-free.

5) Add 1 dl of oil.

6) Stir.

We say that the commands are sequenced one after the other and are being executed

sequentially (in a row, one after the other). Commands usually

represent elementary steps (in the given example, steps 1), 2), 5) and 6) are really elementary steps), but there are also more complex commands, which describe more complex steps (in the example, they are 3) and 4)).

In step 3) the behavior depends on whether the specified condition is met

fulfilled. The condition is the question of whether there is milk, and depending on whether the answer to that question is yes or no, we will pour milk or water into the mixture (it goes without saying that we definitely have water). So, the command is of the form: if the condition is met, then do this and that, otherwise do this and that, and the algorithm execution flow branches at that point (one branch is the case when the branching condition is met, and the other branch is the case when the branching condition is not met). That is why a branch command is said to be present in that step.

In step 4) the action is repeated until some condition is met

fulfilled. Here the mixing of the mixture is repeated and checked all the time to see if there are still any lumps. Only when the lumps disappear, the beating is stopped. Although whisking can be viewed as a continuous action, from an algorithmic point of view it is better to view it as a series of elementary steps (for example, a turn of a whisk or a second of whisking with a mixer) that are repeated. This achieves that some part of the algorithm is repeated cyclically until some condition is met or until some condition is not met. In such situations, a loop is said to be present (also called a cycle, repetition statement, repetitive statement, or iteration statement). There are different ones

forms of loops (usually these are commands of the form "do this and that so many times", "do this and that until this and that happens" or "as long as this and that is valid, do this and that").

Let's also note that step 4 could be formulated as

the following way:

4) Muti. If there are lumps in the mixture, go back to step 4).

So, instead of a loop, the branch command u could have been used

combined with the command of the form "go to step so-and-so". Since at that point the execution of the algorithm jumps to another place, we call such a command a jump command. The jump statement is sometimes called the GOTO statement. It is not desirable in algorithm descriptions because it leads to algorithms and programs that are very difficult to follow and analyze. Therefore, we will avoid it whenever possible.