Scribd Logo
Upload

Welcome to Scribd!

  • Diamond Logic

    Uploaded by

    Prince Lohmod
    8 views1 page
    The document provides instructions for printing the upper and lower halves of a diamond pattern separately. It explains that there will be two loops, one for the upper half using (n+1)/2 lines and one for the lower half using n/2 lines. For the upper half, it gives the formulas to calculate the number of spaces and stars for each line based on the current row number. For the lower half, it restarts the row count at 1 and provides different formulas to calculate the number of spaces and stars for each line.

    Original Description:

    Original Title

    Diamond logic.txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides instructions for printing the upper and lower halves of a diamond pattern separately. It explains that there will be two loops, one for the upper half using (n+1)/2 lines and one for the lower half using n/2 lines. For the upper half, it gives the formulas to calculate the number of spaces and stars for each line based on the current row number. For the lower half, it restarts the row count at 1 and provides different formulas to calculate the number of spaces and stars for each line.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views1 page

    Diamond Logic

    Uploaded by

    Prince Lohmod
    The document provides instructions for printing the upper and lower halves of a diamond pattern separately. It explains that there will be two loops, one for the upper half using (n+1)/2 lines and one for the lower half using n/2 lines. For the upper half, it gives the formulas to calculate the number of spaces and stars for each line based on the current row number. For the lower half, it restarts the row count at 1 and provides different formulas to calculate the number of spaces and stars for each line.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Try to divide this question into two parts.

    Firstly, print the upper half of the


    diamond pattern and then the lower half.
    There will be two loops, one for the upper half i.e. (n+1)/2, and the other for the
    lower half i.e. for the rest n/2 lines.
    When currRow=1,
    For the first-half number of spaces would be (n/2) + 1 - currRow and the number of
    stars would be (2 * currRow) - 1).
    For the second half we re-initialize currRow with 1 then,
    For the second-half number of spaces would be currRow and the number of stars would
    be 2 * ((n/2) - currRow + 1) - 1
    For example, if N=5, then the pattern would look like this,

    I am unable to make logic please help me


    can you make a call for better understanding

    You might also like