Butterfly Pattern Program in Java Language

 

class Demo
{
    public static void main(String args[])
    {
        int n=5;
        //First half-- Upper
        for(int i=1; i<=n; i++){
            //Upper part
            for(int j=1; j<=i; j++){
                System.out.print("*");
            }
            //spaces
            int spaces = 2*(n-i);
            for(int j=1; j<=spaces; j++){
                System.out.print(" ");
            }

            //2nd part
             for(int j=1; j<=i; j++){
                System.out.print("*");
            }
            System.out.println();
        }

        //LowerHalf
       for(int i=n; i>=1; i--){
            //Upper part
            for(int j=1; j<=i; j++){
                System.out.print("*");
            }
            //spaces
            int spaces = 2*(n-i);
            for(int j=1; j<=spaces; j++){
                System.out.print(" ");
            }

            //2nd part
             for(int j=1; j<=i; j++){
                System.out.print("*");
            }
            System.out.println();
        }
    }
}

OUTPUT:
* * ** ** *** *** **** **** ********** ********** **** **** *** *** ** ** * *

Comments

Post a Comment

Popular posts from this blog

Write A C Program To Delete A Single Element From An Array

#include <stdio.h> int main () {     int arr [ 10 ], n, i, position;     printf ( "Enter the size of array: \n " );     scanf ( " %d " , &n);     printf ( "Enter the elements of the array: \n " );     for (i= 0 ;i<n;i++)     {         scanf ( " %d " , & arr [i]);     }     printf ( "Enter the position which  element is delete: \n " );     scanf ( " %d " , &position);     if (position< 1 || position>n)     {         printf ( "Position is Unavailabe! \n " );         return 0 ;     } for (i=position- 1 ; i<n- 1 ;i++) { arr [i]= arr [i+ 1 ]; } n--; printf ( "Updated array is: \n " ); for (i= 0 ; i<n;i++){     printf ( " %d " , arr [i]); } printf ( " \n " ); return 0 ; } OUTPUT- Enter the size of array: 5 Enter the elements of the array: 2 3 9 5 6 Enter the position which element is delete: 3 Updated array
Read more

Evolution of Computer Devices

  Abacus (3000BC) Developed around 3000 years BC by the Mesopotamians and later improved by Chinese, an abacus consists of beads divided into two parts which are movable on the rods of the two parts. Addition and multiplication etc. of numbers is done by using the place value of the digits of the numbers and position of beads in the abacus. Napiers logs and Bones  (1550-1617) Also called Napier's rods, are numbered rods (10 in total) which can be used to perform multiplication of any number by a number 2-9. Blaise Pascals Adding Machine (1642) A machine made up of gears which were used for adding numbers quickly. It consisted of numbered toothed wheels having unique position values. The rotation of wheels controlled the addition and subtraction operations. This machine was capable of carry-transfer automatically. Leibnitz Calculator (1671) Gottfried Leibnitz, a German mathematician, improved the adding machine and constructed at new machine that was able to perform multiplic
Read more