Silvio Peroni

Hi all, here my take on the exercise (available also as [Python file](https://comp-think.github.io/2018-2019/python/my_range_ex4.py) in the GitHub repository), with some comments: ``` # Test case for the algorithm def test_my_range(stop_number, expected):...

@delfimpandiani, while the answer to the exercise is correct, the pseudocode describe a different flow, in particular in the instruction: > elif B in C: This instruction will be executed...

@ilsamoano and @simayguzel Sorry guys, you are totally right. I really don't know how I've read "elif" instead of "if". Apologies.

Hi all, thanks for all the proposed solutions, that look correct to a first sight. Indeed, representing the recursive step with a flowchart could be tricky, but I really liked...

Hi all, Thanks for your answers. Please remember that, even if the flowcharts are an informal way to describe an algorithm, if the computational problem in input says that one...

Hi guys, Thanks a lot for all these new suggestions! I'll try to integrate them in next years lecture notes as additional material! Great work! S.

@HiImBono Answering your question, indeed all the comparisons will be executed before any other boolean operation.

@MattiaSpadoni and @ilsamoano and @lisasiurina > `` ::= "I" > `` ::= "you" There is something strange here... maybe you wanted to refer to `` instead of ``?

Hi all, thanks for the answers, and also thanks for proposing additional strategies that go beyond the simpler "organise the item in the list by hand", that was of course...

Hi all, Thanks for all the answers! Some comments: it is important, in these cases, to clarify in which order the passages have been executed, in particular for the part...