# recursion homework

Recursion is a powerful technique that is often utilized for a variety or problems. Often, people think iteratively rather than recursively. However, when thinking computationally, as in computer language, recursive techniques are often utilized. The simplest definition of recursion is that it is a function that calls itself. For this assignment, view the provided code sample, and answer the questions that follow:

Function CountDown(count)

If (count < 1)
{
return;
}

### Save your time - order a paper!

Get your paper written from scratch within the tight deadline. Our service is a reliable solution to all your troubles. Place an order on any task and we will take care of it. You won’t have to worry about the quality and deadlines

Order Paper Now

Print (â€œThe current count is:â€ +count);
CountDown(count-1);
}

Questions

1. If the call CountDown(10)was issued, what would be the output of the CountDown routine?
2. If the call CountDown(0)was issued, what would be the output of the CountDown routine?
3. What other techniques could be used outside of recursion? What is the benefit of using recursion?