⚡ TL;DR
Print the christmas tree star pattern in Swift. Complete working code, expected output, algorithm explanation, and practice variations for beginners learning loops.
The Christmas Tree Star pattern is a classic loop exercise. Here’s the complete implementation in Swift with working code and output.
Pattern to Print
*
***
*****
*
***
*****
*******
*********
###Implementation
func christmasTree(_ n: Int) {
for _ in 0..<2 {
for i in 1...n { print(String(repeating: " ", count: n - i) + String(repeating: "*", count: 2 * i - 1)) }
}
print(String(repeating: " ", count: n - 1) + "###")
}
christmasTree(4)Output
*
***
*****
*
***
*****
*******
*********
###How It Works
Stack two pyramid sections of increasing height, then finish with a trunk of hash symbols.
Practice Variations
- Try printing the pattern with a different character (e.g.,
#or+) - Modify the code to accept the pattern size as user input
- Combine this pattern with its inverse to create a more complex shape
Complexity
- Time: O(n²) — the grid or line count grows quadratically
- Space: O(1) — only loop counters are needed
Related Patterns
- Christmas Tree Star in Python
- Christmas Tree Star in Dart
- Christmas Tree Star in Go
- Up Arrow Star in Swift
- K Shape Star in Swift
- ZigZag Star in Swift
FAQ
How do you print the Christmas Tree Star pattern in Swift?
Use nested loops: the outer loop walks through the rows while the inner loop prints the characters or values for each row. The complete Swift implementation with expected output is shown in the sections above.
What is the time complexity of the Christmas Tree Star pattern in Swift?
The time complexity is O(n²) and the space complexity is O(1), since the pattern is built with a fixed number of loop counters and printed row by row.
Happy coding!
