Assignment:
Q1. List all the steps used to search for 9 in the sequence 1,3, 4, 5, 6, 8, 9, 11 using a binary search.
Q2. Describe an induction process. How does induction process differ from a process of simple repetition?
Q3. Describe a favorite recreational activity in terms of its iterative components, such as solving a crossword or Sudoku puzzle or playing a game of chess or backgammon. Also, mention any recursive elements that occur.
Q4. Describe a situation in your professional or personal life when recursion, or at least the principle of recursion, played a role in accomplishing a task, such as a large chore that could be decomposed into smaller chunks that were easier to handle separately, but still had the semblance of the overall task. Did you track the completion of this task in any way to ensure that no pieces were left undone, much like an algorithm keeps placeholders to trace a way back from a recursive trajectory? If so, how did you do it? If not, why did you not?
Side Note: Here is the reason we discuss recursion for an IT degree. Recursion is the basis of searching and sorting...here is a quote from the following website (https://www.sparknotes.com/cs/recursion/examples/summary.html)
Next we'll look at how recursion can be used in searching and in sorting to increase the efficiency of these operations. Then we'll look at how recursion can be used for certain mathematical problems, such as printing a number in different bases and computing different sequences of numbers. For most of these problems, recursion presents an incredibly elegant solution that is easy to code and simple to understand.
Recursion may be difficult to understand at first, but once you do it becomes a powerful programming tool.
Q5. Given this recursive algorithm for computing a factorial...
procedure factorial(n: nonnegative integer)
if n = 0 then return 1
else return n *factorial(n − 1)
{output is n!}
Show all the steps used to find 5!
Provide complete and step by step solution for the question and show calculations and use formulas.