You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
25 lines
793 B
25 lines
793 B
|
|
|
|
# WDI-PANTHALASSA
|
|
|
|
---
|
|
Title: Recursion Exercises<br>
|
|
Type: Morning Exercise<br>
|
|
Creator: Thom Page <br>
|
|
Course: WDIr-Panthalassa<br>
|
|
|
|
---
|
|
|
|
#### RECURSION EXERCISES
|
|
|
|
0. Look at the 'recursion notes' file (in the same folder as this file).
|
|
|
|
1. Take your solution to Euler problem 2 and make it so that it uses recursion to solve part or all of the problem. https://projecteuler.net/problem=2
|
|
|
|
2. Read up on Binary Tree Search:
|
|
https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/implementing-binary-search-of-an-array
|
|
|
|
3. Code an algorithm that performs a Binary Tree Search using recursion.
|
|
|
|
4. Go back and look at your solution to the Factorials problem, and see if you can make it work if it doesn't already.
|