To print Floyd's Triangle in Java with Example.

Floyd's Triangle looks like following pattern :

1
2  3
4  5  6
7  8  9  10
11  12  13  14  15

public static void printFlodTrinagle(int row){
int number = 1;
for(int i =1;i<=row;i++)
    for(int j=i ;j<=i;j++)
     {
      system.out.print(number++);
      }
system.out.println();
}

Converting binary to decimal

Algorithm works by getting last digit in each iteration and then multiply it by 2^position, where position starts from zero.

Do the modulus to get the last number, each time increase the power by 1.

public int binary(int binary)
{
int power = 0;
int digit = 0;
while(binary!=0){
int last= binary%10;
digit += last*Math.pow(2,power); //Math.pow(2, power) should be replaced by (1 << power):
power++;
binary = binary/10;
}
}