Crossword Puzzle Of The Week #13 (for Recursion)

In this issue of Crossword Puzzle of the Week, we will dive into the topics of Recursion The solution to the crossword puzzle is provided at the end.

Crossword Puzzle Of The Week #13 (for Recursion)

HINTS:

Down:

1. You get _____ time complexity when the growth rate doubles with each addition to the input (n), often iterating through all subsets of the input elements. Any time an input unit increases by 1, the number of operations executed is doubled.

2. _____ Sort algorithms use recursion to divide the data into smaller subarrays or sublists, sort them, and then merge them back together.

3. The most-common cause of _____ is excessively deep or infinite recursion.

4. Recursive algorithms can be used to explore all the nodes or vertices of a _____ in a systematic way.

5. _____ is a classical recursion based mathematical puzzle where we have three rods (A, B, and C) and N disks.

Across:

6. Recursion uses more memory, because the recursive function adds to the _____ with each recursive call, and keeps the values there until the call is finished.

7. The _____ case is what stops the recursion from continuing on forever.

8. _____ can be a powerful tool for solving complex problems, but it also requires careful implementation to avoid infinite loops and stack overflows.

9. A recursive function is _____ recursive when a recursive call is the last thing executed by the function.

10. _____ can be implemented using recursive functions to compute and cache the results of subproblems.

Solution for Crossword Puzzle #13:

Crossword Puzzle Of The Week #13 (for Recursion)

Answers:

Down:

1. Exponential time
2. Merge
3. StackOver Flow
4. Graph
5. Tower of Hanoi

Across:

6. Stack
7. Base
8. Recursion
9. Tail
10. Memoization