In: Computer Science
When analyzing recursive algorithms, which of the following best describes initial conditions?
| a) Initial conditions express the number of times the basic operation executes when the base case is reached. |
| b) Initial conditions represent the condition for the base case of a recursive function |
| c) Initial conditions express the number of times the basic operation runs during the first execution of the function. |
| d) Initial conditions express the complexity of an algorithm |
Option B