Code #2 | Hello Java Multiple Times

Code #2 | Hello Java Multiple Times | Java

Write a program to print "Hello Java!" ten times.

Output:

Hello Java!

The above problem statement is the extension of the the previous problem statement( Code #1).

For this question, for loop has been used having a counter variable i with initial value of 0 and having a condition less than 10. Further, there is an updation statement i++ which increases the value of the variable i by 1 after each iteration. Inside the for loop, there is a print statement System.out.println("Hello Java!").

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(); w hich 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 seco

Discover More »

Code #1 | Hello Java | Basics of Java

Today starting with a very basic coding program in Java. So, the program is Write a program in Java to print "Hello Java!" Output: Hello Java!

Discover More »

Bubble Sort | Java & Python | MyCodingNetwork | Alok Tripathi

Bubble Sort is a simple sorting algorithm that works by repeatedly comparing and swapping adjacent elements in an array until they are in the correct order. It is called bubble sort because the smaller elements "bubble" to the top of the array, while the larger elements sink to the bottom. Quick Video Explanation: How Bubble Sort Works Bubble sort works by iterating through the array from left to right and comparing each pair of adjacent elements. If the element on the left is larger than the element on the right, they are swapped. This way, the largest element in the array moves to the rightmost position in each iteration. This process is repeated until no more swaps are needed, which means the array is sorted. To illustrate how bubble sort works, let's use the example of sorting the array [30,90,50,10,40] in ascending order. First Iteration/Pass: The first step is to compare the first two elements, 30 and 90. Since 30 is smaller than 90, they are already i

Discover More »

Search This Blog