- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Swift Program to Print Binary Right Triangle Pattern
This tutorial will discuss how to write swift program to print Binary Right triangle pattern.
Binary pattern is a sequence of “0” and “1” which is used to develop different patterns or shapes like pyramid, rectangle, cross, etc.
To create a binary right triangle pattern we can use any of the following methods −
Using nested for loop
Using init() Function
Using stride Function
Below is a demonstration of the same −
Input
Suppose our given input is −
Num = 4
Output
The desired output would be −
1 1 0 1 0 1 1 0 1 0 1 0 1 0 1
METHOD 1- USING NESTED FOR LOOP
We can create a Binary Right triangle pattern or any other pattern using nested for loops. Here each for loop handle different tasks such as outermost for loop is used for new rows, and nested for loop is used to pattern.
Example
The following program shows how to print a binary right triangle pattern using nested for loop.
import Foundation import Glibc // Size of the pattern let num = 4 // Handle the length of pattern for m in 0...num { // Printing Binary Right triangle pattern for n in 0...m { if n % 2 == 0 { print(1, terminator : " ") } else { print(0, terminator : " ") } } print(" ") }
Output
1 1 0 1 0 1 1 0 1 0 1 0 1 0 1
Here, in the above code, we use nested for loops to print binary right triangle pattern. The outer most for loop(starts from 0 to 4) is use to handle the total number of rows are going to print and each row is start with new line. Now the nested for loop(starts from 0 to m) is used to print binary number in right-angled triangle pattern. Here we find binary number using remainder method(n % 2 == 0). If remainder equal to 0 then print 1 otherwise print 0.
METHOD 2- USING INIT() FUNCTION
Swift provide an in-built function named String.init(). Using this function, we can able to create any pattern. String.init() function create a string in which the given character is repeated the specified number of times.
Syntax
Following is the syntax −
String.init(repeating:Character, count: Int)
Here, repeating represent the character which this method repeats and count represent the total number of time the given character repeat in the resultant string.
Example
The following program shows how to print binary right triangle pattern using string.init() function.
import Foundation import Glibc // Size of the pattern let num = 4 // Handle the length of pattern for i in 1...num { // Printing binary right triangle pattern print(String.init(repeating:"01", count:i)) }
Output
01 0101 010101 01010101
Here in the above code, we create a binary right triangle pattern of length 4 using String.init() function. Here we uses for loop(starting from 1 to num) which is used to print each row. In this loop, we use String.init() function. This function prints “01” according to the count value(that is i).
METHOD 3- USING STRIDE FUNCTION
Swift provide an in-built function named stride(). The stride() function is used to move from one value to another with increment or decrement. Or we can say stride() function return a sequence from the starting value but not include end value and each value in the given sequence is steps by the given amount.
Syntax
Following is the syntax −
stride(from:startValue, to: endValue, by:count)
Here,
from − Represent the starting value to used for the given sequence.
to − Represent the end value to limit the given sequence
by − Represent the amount to step by with each iteration, here positive value represents upward iteration or increment and negative value represent the downward iteration or decrement.
Example
The following program shows how to print binary right triangle pattern using stride() function.
import Foundation import Glibc // Size of the pattern let num = 8 // Handle the length of pattern for m in 0...num { // Printing Binary Right triangle pattern // Using stride() function for n in stride(from: 1, to: m, by: 1) { if n % 2 == 0 { print(1, terminator : " ") } else { print(0, terminator : " ") } } print("") }
Output
0 0 1 0 1 0 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0
Here in the above code, we uses nested for loops along with stride() function. The outermost for loop(start from 0 to num) is used to handle the total number of rows are going to print and each row starts with a new line. And the nested for loop is used to print Binary Right triangle pattern using stride() function −
for n in stride(from: 1, to: m, by: 1) { if n % 2 == 0 { print(1, terminator : " ") } else { print(0, terminator : " ") } }
Here the iteration starts from 1 to m and each iteration we check n % 2 == 0. If remainder is equal to 0 then print 1, otherwise print 0.