Which is the base case of the following recursion function: def mult3(n):    if n == 1:        return 3    else:        return mult3(n-1) + 3     else     n == 1

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 6PE
icon
Related questions
Question
  1. Which is the base case of the following recursion function:

    def mult3(n):    if n == 1:        return 3    else:        return mult3(n-1) + 3
       

    else

       
    n == 1
       
    mult3(n)
       
    return mult3(n-1) + 3
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Fibonacci algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning