Back

Question: 2016 Fall Final - 9

Author: Michiel Smid
Consider the recursive algorithm $\Hello$, which takes as input an integer $n \geq 0$: If we run algorithm $\Hello(7)$, how many times is the word "hello" printed?
(a)
4
(b)
7
(c)
6
(d)
5