Skip to main content

Pattern 2 | Java

 Problem Statement:

Write a program to draw the following pattern:

*

* *

* * *

* * * *

* * * * *

(take a variable n which decides the number of rows, for above example, n=5)

THE CODE


Output:

* 
* * 
* * * 
* * * * 
* * * * * 
* * * * * *         
* * * * * * *       
* * * * * * * *     
* * * * * * * * *   
* * * * * * * * * *

Simplification:

In the above problem, the value of n is 10 (i.e., the number of rows are 10)

1. In the first for loop we have i as the counter variable with initial value of 1 and having a condition i.e. i should be less than or equal to n. It has a print statement after the second for loop, 

System.out.println();

which is used for changing the row, each time for the second for loop terminates.

2. In the second for loop we have j as the counter variable with initial value of 1 having a condition i.e. j should be less than or equal to i (the value of i will be as per the current ongoing iteration). Further it has an updation statement j++ Inside the second for loop, there is the print statement,

System.out.print("* ");

to print the stars(*) in a column wise manner.

Hope you liked this explanation, for any doubt you can comment down in the comment section.

Labels:

Popular posts from this blog

Pattern 4 | Java | MyCodingNetwork | Alok Tripathi (Code 6)

Problem Statement: Write a program to draw the following pattern where number of rows are decided by the user and given to the program as input:         *       * *     * * *   * * * * * * * * * * * * * * * (Take a variable n which takes the number of rows as input from the user, For above example, n=6) OUTPUT: The above program is the extension of the previous program (Pattern #3). This program asks the user to input the number of rows that it wants in the program. For accepting the input, the program has Scanner class which has been extracted from the package java.util . In this program, we will learn how to receive data from the user. If you remember in three previous patterns, the program itself had the input of number of rows where n=8, but now the user will tell the program how many rows are to be added.   Simplification 1.     In Line 1, the java.util  package has been imported, to use the Scanner cl...
Discover More »

Pattern 6 | Java | MyCodingNetwork | Alok Tripathi (Code 8)

Problem Statement: Write a program to make a square and mark out its diagonals. Accept the length as input from the user and give output in the following manner: And ( In simple words, we have printed stars (*) on the boundary positions of the matrix and on the centre positions of the matrix we have printed blank space( ) )   THE CODE: Sample Output: In the above program, two int variables r to accept the length of square as input. On line 7, following statement is used to accept the input from the user: int r = sc . nextInt ();   For taking the input Scanner class has been used, more about Scanner class Algorithm: Two for loops are defined: ·         First for loop with counter variable i has initial value 1, conditional statement i less than or equal to r and an updating statement i++ . ·         Inside the first loop there is a second for loop, with counter variable j has ini...
Discover More »

Binary Search | The-Algorithm-Drive | MyCodingNetwork

Binary Search The next algorithm, we are going to study is Binary Search . As the name suggests, it is a searching algorithm. It is one of the very famous searching techniques. Unlike its counterpart linear search, it is way more advanced.  Time complexity of linear search is O(N) whereas that of binary search is O (log N). Source Code: Output Number Found at index =5 Working Let’s come on to the working of the algorithm, as you can see in the above program, we need a sorted array to perform binary search algorithm. 1.    Here, bin function in the above program it accepts 4 parameters, that is, the array arr , lower index low , higher index high and the searching number sn . 2.    Next, we have a do-while loop to check if high is greater than or equal to low (high>=low). If at any point of iteration this condition is not satisfied, it means the searching number sn does not exist in the array. Following is the algorithm for binary search: while ...
Discover More »