We are printing diamond pattern.

import java.util.Scanner;

public class Print_Diamond_Pattern {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        System.out.print("Enter a number: ");
        int n = scan.nextInt();
        int nsp=n-1, nst=1;

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= nsp; j++) {
                System.out.print("  ");
            }

            for (int k = 1; k <= nst; k++) {
                System.out.print("* ");
            }
            nsp--;
            nst +=2;
            System.out.println();
        }

        nsp=1; 
        nst=2*n-3;
        for (int i = 1; i <= n-1; i++) {
            for (int j = 1; j <= nsp; j++) {
                System.out.print("  ");
            }

            for (int k = 1; k <= nst; k++) {
                System.out.print("* ");
            }
            nsp++;
            nst -=2;
            System.out.println();
        }

        scan.close();
    }
}

We are printing hollow star rectangle pattern.

import java.util.Scanner;

public class Print_Hollow_Star_Rectangle_Pattern {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        System.out.print("Enter number of rows: ");
        int row = scan.nextInt();

        System.out.print("Enter number of columns: ");
        int col = scan.nextInt();

        for (int i = 1; i <= row; i++) {
            for (int j = 1; j <= col; j++) {
                if(i == 1 || i == row || j == 1 || j == col) {
                    System.out.print("* ");
                } else {
                     System.out.print("  ");
                }
                
            }
            System.out.println();
        }

        scan.close();
    }
}

We are printing number pyramid pattern.

import java.util.Scanner;

public class Print_Number_Pyramid_Pattern {
   public static void main(String args[]) {
        Scanner scan = new Scanner(System.in);

        System.out.print("Enter a number: ");
        int n = scan.nextInt();

        for(int i=1; i<=n; i++) {
           //spaces
           for(int j=1; j<=n-i; j++) {
               System.out.print(" ");
           }

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

        scan.close();
   }   
}

We are printing palindromic pyramid pattern.

import java.util.Scanner;

public class Print_Palindromic_Pyramid_Pattern {
   public static void main(String args[]) {
        Scanner scan = new Scanner(System.in);

        System.out.print("Enter a number: ");
        int n = scan.nextInt();

        for(int i=1; i<=n; i++) {
           //spaces
           for(int j=1; j<=n-i; j++) {
               System.out.print(" ");
           }

           //first part
           for(int j=i; j>=1; j--) {
               System.out.print(j);
           }

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

        scan.close();
   }   
}

We are printing pyramid pattern.

import java.util.Scanner;

public class Print_Pyramid_Pattern_2 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        System.out.print("Enter a number: ");
        int n = scan.nextInt();
        int nsp=n-1, nst=1;

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= nsp; j++) {
                System.out.print("  ");
            }

            for (int k = 1; k <= nst; k++) {
                System.out.print("* ");
            }
            nsp--;
            nst +=2;
            System.out.println();
        }

        scan.close();
    }
}

We are printing rhombus pattern

import java.util.Scanner;

public class Print_Rhombus_Pattern {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);

        System.out.print("Enter a number: ");
        int n = scan.nextInt();

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n-i; j++) {
                System.out.print("  ");
            }

            for (int k = 1; k <= n; k++) {
                System.out.print("* ");
            }
            System.out.println();
        }

        scan.close();
    }
}

We are doing sort an array with the help of Bubble Sort Algorithm.

import java.util.Scanner;

public class Sort_Array_Using_Bubble_Sorting_Algorithm {

    public static void bubbleSort(int[] arr) {
        int n = arr.length;
         for(int i=0;i<n-1;i++){
            for(int j=0;j<n-1-i;j++){
                if(arr[j]>arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
    }

    public static void print(int[] arr) {
         for(int ele : arr){
            System.out.print(ele+" ");
         }
         System.out.println();
    }

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        // First array input
        System.out.print("Enter size of array: ");
        int n = sc.nextInt();
        int[] arr = new int[n];

        System.out.println("Enter elements of array:");
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        System.out.println("Array Before sorted :");
        print(arr);
        bubbleSort(arr);
        System.out.println("Array after sorted :");
        print(arr);

        
    }

}