Java Program to Print Floyd's Triangle

In this video, we will print Floyd's Triangle using Java language. This program uses Floyd's triangle algorithm to calculate the shortest route from point A to B. Floyd’s triangle algorithm is an efficient method of finding the shortest path through a graph. It works by starting at any vertex and then repeatedly choosing the next vertex that will lead you closer to your destination. If there is no other option available, it will choose the closest vertex.

Algorithm:

1) Initialization of variables. a) Create variables in memory holding rows and columns. b) Create and initialize variable holding patterns or values to be displayed.

2) Traversing over rows and columns using nested for loops. a) Outer loop for rows. b) Inner loop for columns in the current row.

3) Dealing with variables holding dynamic values as per execution as initialized outside nested loops. a) If values are to be displayed, increment this variable inside the loop for rows and outside the loop for columns. b) If patterns are to be displayed, assign the character outside loop while creation and no alternation of holder value in any of the loops.

Floyd's triangle using Java: https://www.geeksforgeeks.org/java-program-to-display-floyds-triangle/