Print Triangle (Top-Down) Recursively
Print right triangle recursively.
IntermediatePhase 3 - Level 3: Pattern RecursionExample 3 of 10
print-triangle-top-down-recursively.py
1def print_stars(n):2 if n == 0:3 return4 print("*", end="")5 print_stars(n - 1)67def print_triangle(n, row=1):8 # Base case9 if row > n:10 return1112 # Print current row13 print_stars(row)14 print()15 # Recurse for next row16 print_triangle(n, row + 1)1718# Test19n = int(input("Enter rows: "))20print_triangle(n)
Output
Enter rows: 5 * ** *** **** *****
What's going on
Print row with row stars, then recurse.
Key Concepts:
Print row stars (1, 2, 3, ...)
Recurse with row + 1
Base case when row > n
🔗Related Content
- 📖
Phase 3 - Learn Concepts
Review Phase 3 concepts and explanations
- 📝
Phase 3 - Quiz
Test your Phase 3 understanding with quiz questions
- 💻
Phase 3 - All Practice Problems
Explore all practice problems for Phase 3
- 🎓
Master Your Logic Building - Complete Course
Browse all phases and tutorials
- 🧠
Logic Building Overview
Learn about the complete logic building curriculum