1) Checks the condition at while i>0 if it is true then j value initialized to j=n-i. The full Inverse Diamond is of 2n-1 rows for an input of n. The program is divided to print this pattern in two parts: The first part is the top half of diamond of n rows. 4) In this example n=7, the condition i>0 is true at the outer loop, in the 1st inner loop the condition fails, comes to next inner loop checks the condition. Algorithm: Start. The outer loop gives i=0 in the first iteration and goes to the inner loop which will work for the range (0,6-i) and print the star(*) for 6 time in a line and the inner loop work is completed. The 1st inner loop prints space if the condition j>0, it runs with the structure for(int j=n-i;j>0;j–), the 2nd inner loop prints character if the condition j