Resolve "Recursions for analysis: only to big-Oh, no proof"

Added three code snippets that the students will have to analyze and give the runtime complexity in Big-Oh notation.

They do not have to prove it, I included in the description that they however should explain how they get their answer.

Closes #37 (closed)