SHARE
SPREAD
HELP

The Tradition of Sharing

Help your friends and juniors by posting answers to the questions that you know. Also post questions that are not available.


To start with, Sr2Jr’s first step is to reduce the expenses related to education. To achieve this goal Sr2Jr organized the textbook’s question and answers. Sr2Jr is community based and need your support to fill the question and answers. The question and answers posted will be available free of cost to all.

 

#
Authors:
Tony Gaddis
Chapter:
Recursion
Exercise:
Programming Exercises
Question:3 | ISBN:9780132576376 | Edition: 2

Question

Write a recursive function that accepts an integer argument, n. The function should display n lines of asterisks on the screen, with the first line showing 1 asterisk, the second line showing 2 asterisks, up to the nth line which shows n asterisks.

TextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbook

Answer

#Create a function name, that accepts an integer argument, n. 
#The function should display n lines of asterisks on the screen, 
#with the first line showing 1 asterisk,
#the second line showing 2 asterisks, up to the nth line which shows n asterisks.
def displayAsterisks(n):
    if n > 0:
        # Recursive call,displayAsterisks
        displayAsterisks(n - 1)
        
        # Display the line of asterisks
        line = "*" * n
        print(line)

# Test the function
n = int(input("Enter a positive integer: "))
print("Displaying", n, "lines of asterisks:")
displayAsterisks(n)

Executed Output 1:

Enter a positive integer: 10
Displaying 10 lines of asterisks:
*
**
***
****
*****
******
*******
********
*********
**********

Executed Output 2:

Enter a positive integer: 25
Displaying 25 lines of asterisks:
*
**
***
****
*****
******
*******
********
*********
**********
***********
************
*************
**************
***************
****************
*****************
******************
*******************
********************
*********************
**********************
***********************
************************
*************************

 

0 0

Discussions

Post the discussion to improve the above solution.