Algorithms

Question 1

Recursive Function Properties

Answer 1

1. Must call itself. The program context for each call is placed on the call stack.
2. Must have a base case/ exit criteria which triggers the end of the recursion. The base case is the smallest problem that can be solved without further recursion
3. Progressive approach. Must move towards its base case

Question 2

What to mention when asked to describe algorithm using big O notation

Answer 2

make sure to mention Worst, Average and Best case scenarios and how they occur