Okay, yes. Then to the second drawing, how does an algorithm work? Hmm, I simply said that the algorithm in this case is 'find somehow', I called it A. Find A' and then it searches from the given information area, it searches for all the characteristics that match this A. This can be... But that will then be differences, which in this case could be numbers, objects or anything else. It does not matter. Quantity is free. And then I told him to pick out all the A's and to use them in this case. As a boundary condition he should sort in ascending order A1, A2, A3 and then give you... What does it say up here? It means search space. It can go on endlessly and then he should output this and say: "Here it is, I've got it. Did the algorithm find it for you? Why does that explain how an algorithm works for you? Well, all right. In the end I have some kind of problem and he should solve the problem for me and my problem was now: I'd like all the A's sorted by size. He can do that too, that should not be a problem. Okay, great. Thanks.