FOR FREE YEAR SOLVED

Floyd's Triangle

Back to Programming

Description

Floyd's Triangle:

Here in this pattern printing, the number of lines of the pattern is taken as the input. Two for loops are used to display the pattern. The first for loop (the outer for loop) is used to count the line number so the loop is from 1 to n. for ith line the number of elements is also i. this aforesaid pattern is known as Floyd’s triangle.

Algorithm

INPUT: the number of lines
OUTPUT: the aforesaid pattern
PROCESS:
Step 1: read n [the number of lines]
Step 2: Set p<-1
for i=1 to n repeat
		For j=1 to i repeat
			Print p
			Set p<-p+1
		[End of ‘for’ loop]
		Move to the next line
	[End of ‘for’ loop]
Step 3: stop.

Code

Time Complexity:

for(i=1;i<=n;i++)------------------------------------------------------ n

                {              for(j=1;j<=i;j++)------------------------------- i

                                {              printf("%d ",p);

                                                p++;  }

                                printf("\n");

                }

The complexity is: O(n*i) = O(n2)

Contributed by