bubblesort2

//elab-source: studentaveragereal.java
import java.util.*;
public class BubbleSort {
    public static void main (String args []){
            Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int[] arr = new int[n];
        int keep = 0;
        int keep2 = 0;
        int deletej = 0;
        // for input values
        for (int i = 0; i < n; i++) {
            arr[i] = input.nextInt();
        }
        // for print arrays
        for (int i = 0; i < n; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
        // for sorting
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr.length - 1 - deletej; j++) {
                if (arr[j] > arr[j + 1]) {
                    keep = arr[j];
                    keep2 = arr[j + 1];
                    arr[j] = keep2;
                    arr[j + 1] = keep;
                }
                for (int p = 0; p < n; p++) {
                    System.out.print(arr[p] + " ");
                }
                System.out.println();

            }
            deletej++;

        }

}
}